3 search results - page 1 / 1 » Pareto Envelopes in Simple Polygons |
IJCGA
2010
13 years 2 months ago
2010
For a set T of n points in a metric space (X, d), a point y X is dominated by a point x X if d(x, t) d(y, t) for all t T and there exists t T such that d(x, t ) < d(y, t )....
CAGD
2010
13 years 2 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...