52 search results - page 10 / 11 » Triangulations Intersect Nicely |
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
CAD
2005
Springer
13 years 5 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
SGP
2007
13 years 8 months ago
2007
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
APPML
2007
13 years 5 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
EJC
2010
13 years 5 months ago
2010
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...