1245 search results - page 34 / 249 » Triangulation for Points on Lines |
100
click to vote
CAD
2007
Springer
14 years 9 months ago
2007
Springer
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
When available, vanishing points in a scene are a key factor in effectively recovering absolute camera orientation, thus simplifying the structure-from-motion problem. We present ...
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
SGP
2003
14 years 11 months ago
2003
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds poin...
106
Voted
COMPGEOM
1996
ACM
15 years 1 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...