Sciweavers

2342 search results - page 155 / 469
» Sublinear geometric algorithms
Sort
View
COMPGEOM
2006
ACM
15 years 9 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
ICCSA
2005
Springer
15 years 8 months ago
Mesh Generation for Symmetrical Geometries
Symmetries are not only fascinating, but they can also be exploited when designing numerical algorithms and data structures for scientific engineering problems in symmetrical doma...
Krister Åhlander
COMPGEOM
2003
ACM
15 years 8 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
3DPVT
2006
IEEE
158views Visualization» more  3DPVT 2006»
15 years 7 months ago
Revealing Significant Medial Structure in Polyhedral Meshes
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
Svetlana Stolpner, Kaleem Siddiqi
COMPGEOM
2005
ACM
15 years 5 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner