1245 search results - page 17 / 249 » Triangulation for Points on Lines |
ISCSCT
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
ASPDAC
2001
ACM
15 years 1 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
CAIP
2007
Springer
15 years 3 months ago
2007
Springer
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon)...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
3DGIS
2006
Springer
15 years 3 months ago
2006
Springer
The extraction of the building models from remote-sensed data is an important work in the geographic information systems. This investigation describes an approach to integrate LIDA...