895 search results - page 4 / 179 » Triangulating Topological Spaces |
COMPGEOM
2004
ACM
14 years 23 days ago
2004
ACM
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
CCCG
2003
13 years 8 months ago
2003
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...
COMPGEOM
2004
ACM
14 years 23 days ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
PODC
2009
ACM
14 years 7 months ago
2009
ACM
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...