21 search results - page 1 / 5 » Vietoris-Rips Complexes of Planar Point Sets |
95
Voted
DCG
2010
14 years 7 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
103
click to vote
GC
2007
Springer
14 years 10 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
106
click to vote
SODA
2000
ACM
14 years 11 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
CVPR
2005
IEEE
16 years 10 days ago
2005
IEEE
We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of di...