1245 search results - page 153 / 249 » Triangulation for Points on Lines |
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
When studying a 3D polyhedron, it is often easier to cut it open and
atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
COMPGEOM
2010
ACM
15 years 1 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
103
click to vote
DAGSTUHL
1997
14 years 11 months ago
1997
This survey presents several techniques for solving variants of the following scattered data interpolation problem: given a nite set of N points in R3, nd a surface that interpola...
108
click to vote
COMGEO
2006
ACM
14 years 10 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...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Occlusions are commonplace in man-made and natural environments; they often result in photometric features where a line terminates at an occluding boundary, resembling a "T&q...