COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We show that the number of unit-area triangles determined by a set of n points in the plane is O(n9/4+ε), for any ε > 0, improving the recent bound O(n44/19) of Dumitrescu et...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...