102291 search results - page 331 / 20459 » Computability in Computational Geometry |
167
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
163
click to vote
COMPGEOM
2009
ACM
16 years 1 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 ...
165
click to vote
COMPGEOM
2009
ACM
16 years 1 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...
186
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
174
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Most of vision-based algorithms for motion and localization estimation requires matching some interest points in a pair of images. After building feature correspondence, it is pos...