71 search results - page 8 / 15 » Optimal Triangulation with Steiner Points |
SODA
2004
ACM
14 years 10 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
SMI
2005
IEEE
15 years 3 months ago
2005
IEEE
Point-based surfaces (i.e. surfaces represented by discrete point sets which are either directly obtained by current 3D acquisition devices or converted from other surface represe...
ICDE
2009
IEEE
15 years 4 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
WINET
2008
14 years 9 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
103
click to vote
SGP
2007
14 years 11 months ago
2007
We introduce an algorithm for reconstructing watertight surfaces from unoriented point sets. Using the Voronoi diagram of the input point set, we deduce a tensor field whose princ...