Log in

Relevant bibliographies by topics / Computing geometry / Journal articles

To see the other types of publications on this topic, follow the link: Computing geometry.

Journal articles on the topic 'Computing geometry'

Author: Grafiati

Published: 2 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Computing geometry.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Hanson, Andrew J., Gerardo Ortiz, Amr Sabry, and Yu-Tsung Tai. "Geometry of discrete quantum computing." Journal of Physics A: Mathematical and Theoretical 46, no. 18 (2013): 185301. http://dx.doi.org/10.1088/1751-8113/46/18/185301.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lloyd, S. "QUANTUM COMPUTING: Computation from Geometry." Science 292, no. 5522 (2001): 1669. http://dx.doi.org/10.1126/science.1062065.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hanson, Andrew J., Gerardo Ortiz, Amr Sabry, and Yu-Tsung Tai. "Corrigendum: Geometry of discrete quantum computing." Journal of Physics A: Mathematical and Theoretical 49, no. 3 (2015): 039501. http://dx.doi.org/10.1088/1751-8113/49/3/039501.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

PIAO, Y., and J. SATO. "Computing Epipolar Geometry from Unsynchronized Cameras." IEICE Transactions on Information and Systems E91-D, no. 8 (2008): 2171–78. http://dx.doi.org/10.1093/ietisy/e91-d.8.2171.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Botana, Francisco, and Tomas Recio. "Computing envelopes in dynamic geometry environments." Annals of Mathematics and Artificial Intelligence 80, no. 1 (2016): 3–20. http://dx.doi.org/10.1007/s10472-016-9500-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zeeman, Christopher. "Three-dimensional theorems for schools." Mathematical Gazette 89, S1 (2005): 1–92. http://dx.doi.org/10.1017/s0025557200590421.

Full text

Abstract:

Geometry is gradually coming back into the school syllabus, but so far only 2-dimensional geometry. I would like to make a case for including some 3-dimensional geometry as well, because the latter is vital for describing the world throughout science, engineering and architecture. Higher-dimensional geometry also comprises a major part of modern research within mathematics itself. Also 3-dimensional geometry fosters both our intuitive understanding and our geometric imagination. It teaches us to see things in the round. It also trains us to see all sides of an argument simultaneously, as oppos

APA, Harvard, Vancouver, ISO, and other styles

7

El Khaldi, Khaldoun, and Elias G. Saleeby. "On the density of lines and Santalo’s formula for computing geometric size measures." Monte Carlo Methods and Applications 26, no. 4 (2020): 315–23. http://dx.doi.org/10.1515/mcma-2020-2071.

Full text

Abstract:

AbstractMethods from integral geometry and geometric probability allow us to estimate geometric size measures indirectly. In this article, a Monte Carlo algorithm for simultaneous estimation of hyper-volumes and hyper-surface areas of a class of compact sets in Euclidean space is developed. The algorithm is based on Santalo’s formula and the Hadwiger formula from integral geometry, and employs a comparison principle to assign geometric probabilities. An essential component of the method is to be able to generate uniform sets of random lines on the sphere. We utilize an empirically established

APA, Harvard, Vancouver, ISO, and other styles

8

Lansdown, John. "Not only computing — also art." ITNOW 31, no. 10 (1989): 16–17. https://doi.org/10.1093/combul/31.10.16.

Full text

Abstract:

Abstract It will come as no surprise to regular readers of these columns that I have something of an obsession with geometry. I developed this interest when I was a student in the 1940s and 1950s but, except at the purely practical level of technical drawing, my enthusiasm rarely seemed to be shared by others. Good texts on geometry were hard to come by and, in the eyes of many academics, the subject seemed to be dead or dying. Currently, I am glad to say, this fascinating discipline is enjoying a resurgence.

APA, Harvard, Vancouver, ISO, and other styles

9

Nessel, Michał, and Szymon Filipowski. "EXAMPLES OF GENETIC ALGORITHMS USAGE IN GEOMETRY AND ALGORITHMIC DESIGN." Boletim da Aproged, no. 34 (December 2018): 31–36. http://dx.doi.org/10.24840/2184-4933_2018-0034_0004.

Full text

Abstract:

In this paper, the authors test genetic algorithms as geometric and design issues’ solvers to explain and explore the possibilities of this computing technique in design and research. The tests and explanations are based on three classical geometry problems of the Ancient Greece and on a pattern distribution algorithm, created by the authors and inspired by the definition of Lebesgue covering dimension. The basic tools for research are: Rhinoceros, the Grasshopper plug-in and the Galapagos tool. The tests prove that, as a result based on computing techniques, genetic algorithms can be used to

APA, Harvard, Vancouver, ISO, and other styles

10

Gyulassy, A., P. Bremer, and V. Pascucci. "Computing Morse-Smale Complexes with Accurate Geometry." IEEE Transactions on Visualization and Computer Graphics 18, no. 12 (2012): 2014–22. http://dx.doi.org/10.1109/tvcg.2012.209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Botana, Francisco. "Computing bisectors in a dynamic geometry environment." International Journal of Mathematical Education in Science and Technology 44, no. 2 (2013): 299–310. http://dx.doi.org/10.1080/0020739x.2012.690900.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Brumitt, B., J. Krumm, B. Meyers, and S. Shafer. "Ubiquitous computing and the role of geometry." IEEE Personal Communications 7, no. 5 (2000): 41–43. http://dx.doi.org/10.1109/98.878536.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Lowther, John L., and Ching-Kuang Shene. "Computing with geometry as an undergraduate course." ACM SIGCSE Bulletin 33, no. 1 (2001): 119–23. http://dx.doi.org/10.1145/366413.364558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Boufama, Boubakeur S., and Roger Mohr. "A Stable and Accurate Algorithm for Computing Epipolar Geometry." International Journal of Pattern Recognition and Artificial Intelligence 12, no. 06 (1998): 817–40. http://dx.doi.org/10.1142/s0218001498000452.

Full text

Abstract:

This paper addresses the problem of computing the fundamental matrix which describes a geometric relationship between a pair of stereo images: the epipolar geometry. In the uncalibrated case, epipolar geometry captures all the 3D information available from the scene. It is of central importance for problems such as 3D reconstruction, self-calibration and feature tracking. Hence, the computation of the fundamental matrix is of great interest. The existing classical methods14 use two steps: a linear step followed by a nonlinear one. However, in some cases, the linear step does not yield a close

APA, Harvard, Vancouver, ISO, and other styles

15

Li, Xinsheng, and Xuedong Yuan. "Fundamental Matrix Computing Based on 3D Metrical Distance." Algorithms 14, no. 3 (2021): 89. http://dx.doi.org/10.3390/a14030089.

Full text

Abstract:

To reconstruct point geometry from multiple images, computation of the fundamental matrix is always necessary. With a new optimization criterion, i.e., the re-projective 3D metric geometric distance rather than projective space under RANSAC (Random Sample And Consensus) framework, our method can reveal the quality of the fundamental matrix visually through 3D reconstruction. The geometric distance is the projection error of 3D points to the corresponding image pixel coordinates in metric space. The reasonable visual figures of the reconstructed scenes are shown but only some numerical result w

APA, Harvard, Vancouver, ISO, and other styles

16

Du, Bowen. "Understanding Human-building Interactions Using Computing." XRDS: Crossroads, The ACM Magazine for Students 30, no. 3 (2024): 20–25. http://dx.doi.org/10.1145/3652919.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Miki, Mitsunori, and Takahira Koita. "Parallel computing for analysis of variable geometry trusses." AIAA Journal 34, no. 7 (1996): 1468–73. http://dx.doi.org/10.2514/3.13255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Gordeev, E. N., and M. A. Kalinovskii. "Stability of solutions in problems of computing geometry." Cybernetics and Systems Analysis 35, no. 2 (1999): 175–83. http://dx.doi.org/10.1007/bf02733466.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Nisar, Ali. "Computing the Urban Sprawl Dynamics through Fractal Geometry." Journal of Controller and Converters 4, no. 3 (2019): 22–34. https://doi.org/10.5281/zenodo.3426853.

Full text

Abstract:

<em>Urban sprawl has become a very magnificent topic throughout the world since last decade. Various techniques, methodologies and quantitative approaches are based to measure urban sprawl in previous researches. In this research a different idea of fractal analysis is introduced to analyze the urban sprawl. In addition density gradient and sprawl index techniques have also been used to characterize the urban sprawl in Karachi. In this study, we have discussed the urban sprawl of Karachi from its first census (1951) to 2012. Massive flight of the population is recorded between 1981 and 1998 to

APA, Harvard, Vancouver, ISO, and other styles

20

Planat, Michel, Raymond Aschheim, Marcelo M. Amaral, and Klee Irwin. "Group Geometrical Axioms for Magic States of Quantum Computing." Mathematics 7, no. 10 (2019): 948. http://dx.doi.org/10.3390/math7100948.

Full text

Abstract:

Let H be a nontrivial subgroup of index d of a free group G and N be the normal closure of H in G. The coset organization in a subgroup H of G provides a group P of permutation gates whose common eigenstates are either stabilizer states of the Pauli group or magic states for universal quantum computing. A subset of magic states consists of states associated to minimal informationally complete measurements, called MIC states. It is shown that, in most cases, the existence of a MIC state entails the two conditions (i) N = G and (ii) no geometry (a triple of cosets cannot produce equal pairwise s

APA, Harvard, Vancouver, ISO, and other styles

21

Miller, Bailey, Rohan Sawhney, Keenan Crane, and Ioannis Gkioulekas. "Differential Walk on Spheres." ACM Transactions on Graphics 43, no. 6 (2024): 1–18. http://dx.doi.org/10.1145/3687913.

Full text

Abstract:

We introduce a Monte Carlo method for computing derivatives of the solution to a partial differential equation (PDE) with respect to problem parameters (such as domain geometry or boundary conditions). Derivatives can be evaluated at arbitrary points, without performing a global solve or constructing a volumetric grid or mesh. The method is hence well suited to inverse problems with complex geometry, such as PDE-constrained shape optimization. Like other walk on spheres (WoS) algorithms, our method is trivial to parallelize, and is agnostic to boundary representation (meshes, splines, implicit

APA, Harvard, Vancouver, ISO, and other styles

22

Espinoza, Jesús F., and Cynthia G. Esquer-Pérez. "Intersection Properties of Finite Disk Collections." Mathematics 12, no. 4 (2024): 547. http://dx.doi.org/10.3390/math12040547.

Full text

Abstract:

In this article, we study the intersection of a finite collection of disks in Euclidean space by examining spheres of various dimensions and their poles (extreme values with respect to canonical projections) contained within the intersection’s boundary. We derive explicit formulae for computing these extreme values and present two applications. The first application involves computing the smallest common rescaling factor for the radii of the disk system, which brings the system to a single point of intersection. This calculation allows us to compute the generalized Čech filtration, a crucial t

APA, Harvard, Vancouver, ISO, and other styles

23

Rodriguez, Jose Israel, and Botong Wang. "Computing Euler Obstruction Functions Using Maximum Likelihood Degrees." International Mathematics Research Notices 2020, no. 20 (2020): 6699–712. http://dx.doi.org/10.1093/imrn/rnz243.

Full text

Abstract:

Abstract We give a numerical algorithm computing Euler obstruction functions using maximum likelihood degrees. The maximum likelihood degree is a well-studied property of a variety in algebraic statistics and computational algebraic geometry. In this article we use this degree to give a new way to compute Euler obstruction functions. We define the maximum likelihood obstruction function and show how it coincides with the Euler obstruction function. With this insight, we are able to bring new tools of computational algebraic geometry to study Euler obstruction functions.

APA, Harvard, Vancouver, ISO, and other styles

24

Nien, Chia-Hsing, and Frederick J. Wicklin. "An Algorithm for the Computation of Preimages in Noninvertible Mappings." International Journal of Bifurcation and Chaos 08, no. 02 (1998): 415–22. http://dx.doi.org/10.1142/s0218127498000279.

Full text

Abstract:

For discrete dynamical systems generated by iterating a diffeomorphism, every point in the phase space has a unique preimage and it is straightforward to compute geometric structures such as inverse orbits and one-dimensional stable manifolds of periodic points. For noninvertible mappings, however, some points have multiple preimages; others may have no preimages. This makes the computation of inverse orbits difficult, because accurate computations require global knowledge about the way the mapping folds and pleats phase space. In this article we use ideas from singularity theory to examine th

APA, Harvard, Vancouver, ISO, and other styles

25

MAIOLI, D. S., C. LAVOR, and D. S. GONÇALVES. "A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN." ANZIAM Journal 59, no. 2 (2017): 271–79. http://dx.doi.org/10.1017/s1446181117000372.

Full text

Abstract:

Finding the intersection of $n$-dimensional spheres in $\mathbb{R}^{n}$ is an interesting problem with applications in trilateration, global positioning systems, multidimensional scaling and distance geometry. In this paper, we generalize some known results on finding the intersection of spheres, based on QR decomposition. Our main result describes the intersection of any number of $n$-dimensional spheres without the assumption that the centres of the spheres are affinely independent. A possible application in the interval distance geometry problem is also briefly discussed.

APA, Harvard, Vancouver, ISO, and other styles

26

BAUTISTA JACOBO, JUANA LILIA, HUGO JIMENEZ HERNANDEZ, JOSE JULIAN MONTES RODRIGUEZ, ESPERANZA RODRIGUEZ MORALES, and HUGO GUAMEZ CUATZIN. "AUTOMATED AIRFOIL CONSTRUCTION: A SOLUTION USING EVOLUTIONARY COMPUTING." DYNA 97, no. 6 (2022): 578. http://dx.doi.org/10.6036/10678.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Hindmarsh, Richard C. A., Gwendolyn J. M. C. Leysinger Vieli, and Frédéric Parrenin. "A large-scale numerical model for computing isochrone geometry." Annals of Glaciology 50, no. 51 (2009): 130–40. http://dx.doi.org/10.3189/172756409789097450.

Full text

Abstract:

AbstractA finite-difference model for the calculation of radar layer geometries in large ice masses is presented. Balance velocities are used as coefficients in the age equation and in the heat equation. Solution of the heat equation allows prediction of sliding areas and computation of basal melt rates. Vertical distributions of velocity are parameterized using shape functions. These can be set uniformly, or allowed to vary in space according to the distribution of sliding. The vertical coordinate can either be uniformly distributed within the thickness of the ice, or be uniformly distributed

APA, Harvard, Vancouver, ISO, and other styles

28

Shene, Ching-Kuang, and John Lowther. "Computing with geometry as an undergraduate course (poster session)." ACM SIGCSE Bulletin 32, no. 3 (2000): 193. http://dx.doi.org/10.1145/353519.343237.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Luo, Xiaonan. "A Progressive Geometry Simplification Method for Mobile Computing Terminal." Journal of Computer Research and Development 44, no. 6 (2007): 1038. http://dx.doi.org/10.1360/crad20070617.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Pourmand, Saeid, Wyatt D. Whiting, Alireza Aghasi, and Nicholas F. Marshall. "Laplace-HDC: Understanding the Geometry of Binary Hyperdimensional Computing." Journal of Artificial Intelligence Research 82 (March 12, 2025): 1293–323. https://doi.org/10.1613/jair.1.17688.

Full text

Abstract:

This paper studies the geometry of binary hyperdimensional computing (HDC), a computational scheme in which data are encoded using high-dimensional binary vectors. We establish a result about the similarity structure induced by the HDC binding operator and show that the Laplace kernel naturally arises in this setting, motivating our new encoding method Laplace-HDC, which improves upon previous methods. We describe how our results indicate limitations of binary HDC in encoding spatial information from images and discuss potential solutions, including using Haar convolutional features and the de

APA, Harvard, Vancouver, ISO, and other styles

31

BOKKA, V., H. GURLA, S. OLARIU, J. L. SCHWING, and I. STOJMENOVIĆ. "TIME-OPTIMAL DIGITAL GEOMETRY ALGORITHMS ON MESHES WITH MULTIPLE BROADCASTING." International Journal of Pattern Recognition and Artificial Intelligence 09, no. 04 (1995): 601–13. http://dx.doi.org/10.1142/s0218001495000225.

Full text

Abstract:

The main contribution of this work is to show that a number of digital geometry problems can be solved elegantly on meshes with multiple broadcasting by using a time-optimal solution to the leftmost one problem as a basic subroutine. Consider a binary image pretiled onto a mesh with multiple broadcasting of size [Formula: see text] one pixel per processor. Our first contribution is to prove an Ω(n1/6) time lower bound for the problem of deciding whether the image contains at least one black pixel. We then obtain time lower bounds for many other digital geometry problems by reducing this fundam

APA, Harvard, Vancouver, ISO, and other styles

32

Zbiek, Rose Mary. "The Pentagon Problem: Geometric Reasoning with Technology." Mathematics Teacher 89, no. 2 (1996): 86–90. http://dx.doi.org/10.5951/mt.89.2.0086.

Full text

Abstract:

We value the use of technology in mathematics learning and teaching, and we want students to reason and to explore mathematical ideas in their mathematics courses. In recent years, such computing tools as The Geometer's Sketchpad (1991) and Cabri Geometry II (1994) allow us to devise and operate on geometric figures similarly as symbolic manipulators allow us to work with algebraic expressions. In this article, we call these tools figure manipulators. These tools make it possible for students to explore and connect geometric ideas from synthetic, analytic, and transformational perspectives. Ye

APA, Harvard, Vancouver, ISO, and other styles

33

Nielsen, Frank. "The Siegel–Klein Disk: Hilbert Geometry of the Siegel Disk Domain." Entropy 22, no. 9 (2020): 1019. http://dx.doi.org/10.3390/e22091019.

Full text

Abstract:

We study the Hilbert geometry induced by the Siegel disk domain, an open-bounded convex set of complex square matrices of operator norm strictly less than one. This Hilbert geometry yields a generalization of the Klein disk model of hyperbolic geometry, henceforth called the Siegel–Klein disk model to differentiate it from the classical Siegel upper plane and disk domains. In the Siegel–Klein disk, geodesics are by construction always unique and Euclidean straight, allowing one to design efficient geometric algorithms and data structures from computational geometry. For example, we show how to

APA, Harvard, Vancouver, ISO, and other styles

34

Salzburger, A., J. Niermann, B. Yeo, and A. Krasznahorkay. "Detray: a compile time polymorphic tracking geometry description." Journal of Physics: Conference Series 2438, no. 1 (2023): 012026. http://dx.doi.org/10.1088/1742-6596/2438/1/012026.

Full text

Abstract:

Abstract A detailed geometry description is essential to any high quality track reconstruction application. In current C++ based track reconstruction software libraries this is often achieved by an object oriented, polymorphic geometry description that implements different shapes and objects by extending a common base class. Such a design, however, has been shown to be problematic when attempting to adapt these applications to run on heterogeneous computing hardware, particularly on hardware accelerators. We present detray, a compile time polymorphic and yet accurate track reconstruction geome

APA, Harvard, Vancouver, ISO, and other styles

35

JIANG, D., and N. F. STEWART. "FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA." International Journal of Computational Geometry & Applications 19, no. 04 (2009): 371–85. http://dx.doi.org/10.1142/s0218195909003015.

Full text

Abstract:

It has been suggested in the literature that ordinary finite-precision floating-point arithmetic is inadequate for geometric computation, and that researchers in numerical analysis may believe that the difficulties of error in geometric computation can be overcome by simple approaches. It is the purpose of this paper to show that these suggestions, based on an example showing failure of a certain algorithm for computing planar convex hulls, are misleading, and why this is so. It is first shown how the now-classical backward error analysis can be applied in the area of computational geometry. T

APA, Harvard, Vancouver, ISO, and other styles

36

Lyu, Zhengyu, Wulamu Aziguli, and Dezheng Zhang. "Geometry-V-Sub: An Efficient Graph Attention Network Struct Based Model for Node Classification." Applied Sciences 12, no. 14 (2022): 7246. http://dx.doi.org/10.3390/app12147246.

Full text

Abstract:

With the development of deep learning and graph deep learning, the network structure is more and more complex, and the parameters in the network model and the computing resources and storage resources required are increasing. The lightweight design and optimization of the network structure is conducive to reducing the required computing resources and storage resources, reducing the requirements of the network model on the computing environment, increasing its scope of application, reducing the consumption of energy in computing, and is conducive to environmental protection. The contribution of

APA, Harvard, Vancouver, ISO, and other styles

37

Vasilakos, Dr Thanos, and Dr Marco Painho. "Soft Computing." Soft Computing 7, no. 7 (2003): 489. http://dx.doi.org/10.1007/s00500-003-0300-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Datta, Sambit, and David Beynon. "A Computational Approach to the Reconstruction of Surface Geometry from Early Temple Superstructures." International Journal of Architectural Computing 3, no. 4 (2005): 471–86. http://dx.doi.org/10.1260/147807705777781068.

Full text

Abstract:

Recovering the control or implicit geometry underlying temple architecture requires bringing together fragments of evidence from field measurements, relating these to mathematical and geometric descriptions in canonical texts and proposing “best-fit” constructive models. While scholars in the field have traditionally used manual methods, the innovative application of niche computational techniques can help extend the study of artefact geometry. This paper demonstrates the application of a hybrid computational approach to the problem of recovering the surface geometry of early temple superstruc

APA, Harvard, Vancouver, ISO, and other styles

39

Berardini, Elena, Alain Couvreur, and Grégoire Lecerf. "A Proof of the Brill-Noether Method from Scratch." ACM Communications in Computer Algebra 57, no. 4 (2023): 200–229. http://dx.doi.org/10.1145/3653002.3653004.

Full text

Abstract:

In 1874 Brill and Noether designed a seminal geometric method for computing bases of Riemann-Roch spaces. From then, their method has led to several algorithms, some of them being implemented in computer algebra systems. The usual proofs often rely on abstract concepts of algebraic geometry and commutative algebra. In this paper we present a short self-contained and elementary proof that mostly needs Newton polygons, Hensel lifting, bivariate resultants, and Chinese remaindering.

APA, Harvard, Vancouver, ISO, and other styles

40

Petre, Ivona Camelia, Alin Pohoata, Carmen Popa, and Carmen Adriana Cîrstoiu. "Technical Applications of the Descriptive Geometry and the Numerical Methods." Applied Mechanics and Materials 659 (October 2014): 565–70. http://dx.doi.org/10.4028/www.scientific.net/amm.659.565.

Full text

Abstract:

Many problems of graphic building encountered in engineering are in fact problems of geometry. The continuous development of the modern technology and the appearance of the drawing and computing software solutions, allows the solving problems in several ways: using descriptive geometry or numerical methods. This paper proposes to establish a pipeline unfolding first using descriptive geometry then giving an easy programmable algorithm based on geometrical and numerical analysis considerations.

APA, Harvard, Vancouver, ISO, and other styles

41

Gupta, B. B., Dharma P. Agrawal, Shingo Yamaguchi, and Michael Sheng. "Soft computing techniques for big data and cloud computing." Soft Computing 24, no. 8 (2020): 5483–84. http://dx.doi.org/10.1007/s00500-020-04766-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Yu, Shangshu, Xiaotian Sun, Wen Li, et al. "STGC-NeRF: Spatial-Temporal Geometric Consistency for LiDAR Neural Radiance Fields in Dynamic Scenes." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 9 (2025): 9644–52. https://doi.org/10.1609/aaai.v39i9.33045.

Full text

Abstract:

While Neural Radiance Fields (NeRFs) have advanced the frontiers of novel view synthesis (NVS) using LiDAR data, they still struggle in dynamic scenes. Due to the low frequency and sparsity characteristics of LiDAR point clouds, it is challenging to spontaneously learn a dynamic and consistent scene representation from posed scans. In this paper, we propose STGC-NeRF, a novel LiDAR NeRF method that combines spatial-temporal geometry consistency to enhance the reconstruction of dynamic scenes. First, we propose a temporal geometry consistency regularization to enhance the regression of time-var

APA, Harvard, Vancouver, ISO, and other styles

43

Ou, Yuan Han, Di Liu, Zhen Tian Hu, and Ying Tan. "Photo Viewer Using Geometry Method." Applied Mechanics and Materials 241-244 (December 2012): 2915–20. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.2915.

Full text

Abstract:

Traditional photo viewer can not provide 3D relationships of geometry scene between two photos. This paper presents a novel photo viewer using geometry method, and the only preparation work of our method is computing photos’ geometry information in advance. Our method first computed morphing matrixes from geometry information. We then constructed a camera motion using cosine function. Next, the morphing matrixes and camera motion were combined to draw a double-layer transition between two photos. Lastly, we demonstrated our photo viewer on a series of photos in campus. The results of a user st

APA, Harvard, Vancouver, ISO, and other styles

44

Waterman, David G., Graeme Winter, Richard J. Gildea, et al. "Diffraction-geometry refinement in theDIALSframework." Acta Crystallographica Section D Structural Biology 72, no. 4 (2016): 558–75. http://dx.doi.org/10.1107/s2059798316002187.

Full text

Abstract:

Rapid data collection and modern computing resources provide the opportunity to revisit the task of optimizing the model of diffraction geometry prior to integration. A comprehensive description is given of new software that builds upon established methods by performing a single global refinement procedure, utilizing a smoothly varying model of the crystal lattice where appropriate. This global refinement technique extends to multiple data sets, providing useful constraints to handle the problem of correlated parameters, particularly for small wedges of data. Examples of advanced uses of the s

APA, Harvard, Vancouver, ISO, and other styles

45

BRANDENBURSKY, MICHAEL, ŚWIATOSŁAW R. GAL, JAREK KĘDRA, and MICHAŁ MARCINKOWSKI. "THE CANCELLATION NORM AND THE GEOMETRY OF BI-INVARIANT WORD METRICS." Glasgow Mathematical Journal 58, no. 1 (2015): 153–76. http://dx.doi.org/10.1017/s0017089515000129.

Full text

Abstract:

AbstractWe study bi-invariant word metrics on groups. We provide an efficient algorithm for computing the bi-invariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the bi-invariant Cayley graph of a nonabelian free group. We investigate the geometry of cyclic subgroups. We observe that in many classes of groups, cyclic subgroups are either bounded or detected by homogeneous quasimorphisms. We call this property the bq-dichotomy and we prove it for many classes of groups of geometric origin.

APA, Harvard, Vancouver, ISO, and other styles

46

Zhanabayev, Zhaksylyk, Nurlan Umbetov, and Adil Zhakash. "On the place of the subject «Descriptive geometry» in the subject «Applied Geometry»." Рroblems of engineering and professional education 77, no. 2 (2025): 69–78. https://doi.org/10.32523/2220-685x-2025-77-2-69-78.

Full text

Abstract:

The article comprehensively considers the importance of the subject «Descriptive geometry» as a component of vocational education in technical higher educational institutions. This subject serves as the basis for the development of students' spatial thinking, mastering the skills of graphical representation of geometric figures, as well as the formation of the ability to transform two-dimensional and three-dimensional models of technical objects. Descriptive geometry is not only a theoretical subject in the engineering education system, but also an important tool aimed at solving engineering p

APA, Harvard, Vancouver, ISO, and other styles

47

BREEN, DAVID, PARAS WADEKAR, CHELSEA AMANATIDES, GENEVIEVE DION, and RANDALL KAMIEN. "GEOMETRIC AND MECHANICAL MODELING OF WEFTKNITTED FABRICS USING HELICOID SCAFFOLDS." Fibres and Textiles 32, no. 1 (2025): 5–12. https://doi.org/10.15240/tul/008/2025-1-001.

Full text

Abstract:

We present a bicontinuous, minimal surface (the helicoid) as a scaffold on which to define the topology and geometry of yarns in a weft-knitted fabric. Modeling with helicoids offers a geometric approach to simulating a physical manufacturing process, which should generate geometric models suitable for downstream analyses. The centerline of a yarn in a knitted fabric is specified as a geodesic path, with constrained boundary conditions, running along a helicoid at a fixed distance. The shape of the yarn’s centerline is produced via an optimization process over a polyline. The distances between

APA, Harvard, Vancouver, ISO, and other styles

48

Feng, Sheng, Xiaoqiang Hua, Yongxian Wang, Qiang Lan, and Xiaoqian Zhu. "Matrix Information Geometry for Signal Detection via Hybrid MPI/OpenMP." Entropy 21, no. 12 (2019): 1184. http://dx.doi.org/10.3390/e21121184.

Full text

Abstract:

The matrix information geometric signal detection (MIGSD) method has achieved satisfactory performance in many contexts of signal processing. However, this method involves many matrix exponential, logarithmic, and inverse operations, which result in high computational cost and limits in analyzing the detection performance in the case of a high-dimensional matrix. To address these problems, in this paper, a high-performance computing (HPC)-based MIGSD method is proposed, which is implemented using the hybrid message passing interface (MPI) and open multiple processing (OpenMP) techniques. Speci

APA, Harvard, Vancouver, ISO, and other styles

49

Song, Fangying, Chuanju Xu, and George Em Karniadakis. "Computing Fractional Laplacians on Complex-Geometry Domains: Algorithms and Simulations." SIAM Journal on Scientific Computing 39, no. 4 (2017): A1320—A1344. http://dx.doi.org/10.1137/16m1078197.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Luo, Y. "The analysis and computing of geometry object in information integration." International Journal of Computer Aided Engineering and Technology 4, no. 5 (2012): 465. http://dx.doi.org/10.1504/ijcaet.2012.048842.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!