83 search results - page 14 / 17 » Acute Triangulations of Polygons |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
CVPR
1999
IEEE
14 years 9 months ago
1999
IEEE
We are developing a system to extract geodetic, textured CAD models from thousands of initially uncontrolled, close-range ground and aerial images of urban scenes. Here we describ...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We describe some techniques that can be used to represent and detect deformable shapes in images. The main difficulty with deformable template models is the very large or infinite...