137 search results - page 16 / 28 » On polygons excluding point sets |
107
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We present an algorithm which provably reconstructs a collection of curves with corners and endpoints from a sample set that satisfies a certain sampling condition. The algorithm ...
169
click to vote
CG
2004
Springer
15 years 4 months ago
2004
Springer
We present 3D video fragments, a dynamic point sample framework for real-time free-viewpoint video. By generalizing 2D video pixels towards 3D irregular point samples we combine t...
158
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
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...
161
click to vote
WADS
2009
Springer
15 years 11 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
138
click to vote
SIGACT
2008
15 years 4 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...