5128 search results - page 377 / 1026 » Discrete Component Analysis |
215
Voted
IEEECGIV
2009
IEEE
16 years 2 months ago
2009
IEEE
—We present a novel algorithm to segment a 3D surface mesh into visually meaningful regions. Our approach is based on an analysis of the local geometry of vertices. In particular...
197
Voted
COMPGEOM
2009
ACM
16 years 2 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...
188
Voted
COMPGEOM
2009
ACM
16 years 2 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 ...
185
Voted
COMPGEOM
2009
ACM
16 years 2 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
199
Voted
SMA
2009
ACM
16 years 2 months ago
2009
ACM
Current mesh reduction techniques, while numerous, all primarily reduce mesh size by successive element deletion (e.g. edge collapses) with the goal of geometric and topological f...