Sciweavers

7351 search results - page 13 / 1471
» Segmenting Point Sets
Sort
View
CCCG
2006
15 years 1 months ago
Spanning trees across axis-parallel segments
Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segme...
Csaba D. Tóth, Michael Hoffmann
IPL
2008
104views more  IPL 2008»
14 years 11 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
CAD
2007
Springer
14 years 11 months ago
Detection of closed sharp edges in point clouds using normal estimation and graph theory
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...
Kris Demarsin, Denis Vanderstraeten, Tim Volodine,...
COMPGEOM
2004
ACM
15 years 5 months ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
ISBI
2006
IEEE
16 years 14 days ago
Coronary tree extraction from X-ray angiograms using marked point processes
In this paper, we use marked point processes to perform an unsupervised extraction of the coronary tree from 2D X-ray angiography. These processes provide a rigorous framework bas...
Caroline Lacoste, Gérard Finet, Isabelle E....