[PDF][PDF] Triangulations in CGAL
Triangulations in CGAL* Page 1 Triangulations in CGAL* [Extended Abstract] Jean Daniel
Boissonnat Olivier Devillers Monique Teillaud INRIA BP93 06902 Sophia Antipolis, France …
Boissonnat Olivier Devillers Monique Teillaud INRIA BP93 06902 Sophia Antipolis, France …
Walking in a triangulation
Walking in a triangulation Page 1 Walking in a triangulation Olivier Devillers Sylvain Pion
Monique Teillaud ABSTRACT Given a triangulation in the plane or a tetrahedralization in 3-space …
Monique Teillaud ABSTRACT Given a triangulation in the plane or a tetrahedralization in 3-space …
Point location
J Snoeyink - Handbook of discrete and computational geometry, 2017 - taylorfrancis.com
“Where am I?” is a basic question for many computer applications that employ geometric
structures (eg, in computer graphics, geographic information systems, robotics, and …
structures (eg, in computer graphics, geographic information systems, robotics, and …
[图书][B] Effective computational geometry for curves and surfaces
JD Boissonnat, M Teillaud - 2007 - Springer
Computational geometry emerged as a discipline in the seventies and has had considerable
success in improving the asymptotic complexity of the solutions to basic geometric problems …
success in improving the asymptotic complexity of the solutions to basic geometric problems …
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they
perform very badly on large data because of their inherently random memory access …
perform very badly on large data because of their inherently random memory access …
On deletion in Delaunay triangulations
O Devillers - Proceedings of the fifteenth annual symposium on …, 1999 - dl.acm.org
This paper presents how the space of spheres and shelling may be used to delete a point
from a d-dimensional triangulation efficiently. In dimension two, if Ic is the degree of the …
from a d-dimensional triangulation efficiently. In dimension two, if Ic is the degree of the …
Delaunay bifiltrations of functions on point clouds
Abstract The Delaunay filtration D.(X) of a point cloud X⊂ ℝd is a central tool of
computational topology. Its use is justified by the topological equivalence of D.(X) and the …
computational topology. Its use is justified by the topological equivalence of D.(X) and the …
[图书][B] Geometric data structures for computer graphics
E Langetepe, G Zachmann - 2006 - taylorfrancis.com
Data structures and tools from computational geometry help to solve problems in computer
graphics; these methods have been widely adopted by the computer graphics community …
graphics; these methods have been widely adopted by the computer graphics community …
Differentiable surface triangulation
Triangle meshes remain the most popular data representation for surface geometry. This
ubiquitous representation is essentially a hybrid one that decouples continuous vertex …
ubiquitous representation is essentially a hybrid one that decouples continuous vertex …
Complexity of the delaunay triangulation of points on surfaces the smooth case
D Attali, JD Boissonnat, A Lieutier - Proceedings of the nineteenth …, 2003 - dl.acm.org
It is well known that the complexity of the Delaunay triangulation of N points in R 3, ie the
number of its faces, can be O (N2). The case of points distributed on a surface is of great …
number of its faces, can be O (N2). The case of points distributed on a surface is of great …