91 search results - page 7 / 19 » Triangulating a Plane |
ISAAC
2000
Springer
14 years 2 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
ICCV
2005
IEEE
15 years 23 days ago
2005
IEEE
We investigate the feasibility of reconstructing an arbitrarily-shaped specular scene (refractive or mirror-like) from one or more viewpoints. By reducing shape recovery to the pr...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
CCCG
2009
13 years 12 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
BMVC
2002
14 years 1 months ago
2002
This paper presents new techniques for improving the structural quality of automatically acquired architectural 3D models. Common architectural features like parallelism and ortho...