189 search results - page 29 / 38 » Graph-Theoretic Solutions to Computational Geometry Problems |
IMR
2005
Springer
14 years 1 months ago
2005
Springer
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
We derive a new class of photometric invariants that can be used for a variety of vision tasks including lighting invariant material segmentation, change detection and tracking, a...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...