Download:
|
by Kasturi R. Varadarajan, Kasturi R. Varadarajan, Pankaj K. Agarwal, Pankaj K. Agarwal
In Proceedings of the Seventh Canadian Conference on Computational Geometry
ftp://ftp.cs.duke.edu/pub/dist/techreport/1996/1996-01.ps.gz
Add To MetaCart
Abstract:
Let P = fP 1; P 2; : : : ; Pm g be a set of m convex polygons in the plane with a total number of n vertices, and for 1 i m, let w i 2 R be a weight associated with P i. The weighted distance between a line ` and a polygon P i is given by d(`; P i) = min p2P i;q2 ` d(p; q):w i, where d(p; q) is the Euclidean distance between p and q. We want to compute a line ` that minimizes the maximium distance between ` and the polygons of P. We present an O(nff(n) log 3
Citations
|
610
|
Algorithms in combinatorial geometry
– Edelsbrunner
- 1987
|
|
345
|
Applications of random sampling in computational geometry
– Clarkson
- 1989
|
|
322
|
Davenport-Schinzel Sequences and Their Geometric Applications
– Sharir, Agarwal
- 1995
|
|
142
|
Ray shooting and parametric search
– Agarwal, Matouˇsek
- 1993
|
|
98
|
Parallelism in comparison problems
– Valiant
- 1975
|
|
72
|
Almost tight upper bounds for lower envelopes in higher dimensions. Discrete Comput. Geom
– Sharir
- 1994
|
|
61
|
Computing the width of a set
– Houle, Toussaint
- 1988
|
|
39
|
width, closest line pair, and parametric searching, Discrete Comput
– Chazelle, Edelsbrunner, et al.
- 1993
|
|
35
|
Geometric complexity of some location problems
– Lee, Wu
- 1986
|
|
34
|
Geometric partitioning made easier, even in parallel
– Goodrich
- 1993
|
|
31
|
Geometric transversal theory
– Goodman, Pollack, et al.
- 1993
|
|
29
|
Using approximation algorithms to design parallel algorithms that may ignore processor allocation
– Goodrich
- 1991
|
|
16
|
Stabbing line segments
– Edelsbrunner, Maurer, et al.
- 1982
|
|
15
|
Finding the upper envelope of n line segments
– Hershberger
- 1989
|
|
14
|
Planar geometric location problems, Algorithmica 11
– Agarwal, Sharir
- 1994
|
|
13
|
Hyperplane approximation and related topics
– Korneenko, Martini
- 1993
|
|
12
|
Efficient algorithms for common transversals
– Atallah, Bajaj
- 1987
|
|
12
|
An on-line algorithm for fitting straight lines between data ranges
– O'Rourke
- 1981
|
|
11
|
The overlay of lower envelopes in three dimensions and its applications
– Agarwal, Schwarzkopf, et al.
- 1995
|
|
8
|
The exact fitting problem for points
– Guibas, Overmars, et al.
- 1996
|
|
5
|
Applying parallel computation in the design of serial algorithms
– Megiddo
- 1983
|
|
5
|
Linear approximation of simple objects
– Robert, Toussaint
- 1994
|
|
2
|
Optimal placement of a line relative to a planar point system
– Doroshko, Korneenko, et al.
- 1984
|
|
2
|
Approximations and optimal geometric divide and conquer
– Matousek
- 1991
|
|
2
|
On the complexity of approximating polygonal curves
– Toussaint
- 1985
|
|
1
|
Algorithmic techniques for geometric optimization, Computer Science Today: Recent Trands and Developments
– Agarwal, Sharir
- 1995
|
|
1
|
Polygonal approximations of a curve
– Imai, Iri
- 1988
|
|
1
|
Norback, Linear facility location---solving extensions of the basic problem
– Morris, P
- 1983
|
