Sciweavers

137 search results - page 16 / 28
» On polygons excluding point sets
Sort
View
SODA
2001
ACM
67views Algorithms» more  SODA 2001»
13 years 9 months ago
Reconstructing a collection of curves with corners and endpoints
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 ...
Stefan Funke, Edgar A. Ramos
CG
2004
Springer
13 years 8 months ago
3D video fragments: dynamic point samples for real-time free-viewpoint video
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...
Stephan Würmlin, Edouard Lamboray, Markus H. ...
COMPGEOM
2006
ACM
14 years 2 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
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 3 months ago
Resolving Loads with Positive Interior Stresses
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...
Günter Rote, André Schulz
SIGACT
2008
103views more  SIGACT 2008»
13 years 8 months ago
Computational geometry column 50
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...
Joseph O'Rourke