Applications of parametric searching in geometric optimization

Applications of parametric searching in geometric optimization (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Pankaj K. Agarwal , Micha Sharir

Venue:	J. Algorithms
Citations:	88 - 20 self

BibTeX

@ARTICLE{Agarwal94applicationsof,
    author = {Pankaj K. Agarwal and Micha Sharir},
    title = {Applications of parametric searching in geometric optimization},
    journal = {J. Algorithms},
    year = {1994},
    volume = {17},
    pages = {292--318}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

z Sivan Toledo x

Citations

1611	Computational Geometry. An Introduction - Preparata, Shamos - 1985
356	Applications of random sampling in computational geometry - Clarkson, Shor
308	Quantifier elimination for real closed fields by cylindrical algebraic decomposition - COLLINS - 1975
268	Triangulating a simple polygon in linear time - Chazelle - 1991
247	Algorithms for reporting and counting geometric intersections - Bentley, Ottmann - 1979
239	Epsilon-nets and simplex range queries - Haussler, Welzl - 1987
224	Applying parallel computation algorithms in design of serial algorithms - Megiddo - 1983
182	Linear-Time Algorithms for Linear Programming in R3 and Related Problems - Megiddo - 1983
168	Linear programming in linear time when the dimension is fixed - Megiddo - 1984
129	On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput - Kedem, Livne, et al.
121	Ray shooting and parametric search - Agarwal, Matouˇsek - 1993
101	Slowing down sorting networks to obtain faster sorting algorithms - Cole - 1984
101	Parallelism in comparison problems - Valiant - 1975
98	Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 - Hart, Sharir - 1986
91	An efficient parallel biconnectivity algorithm - Tarjan, Vishkin - 1985
79	The upper envelope of Voronoi surfaces and its applications - Huttenlocher, Kedem, et al. - 1991
74	Visibility and intersection problems in plane geometry - Chazelle, Guibas - 1985
71	Efficient partition trees - Matoušek - 1992
69	Sharp upper and lower bounds on the lengths of general Davenport-Schinzel sequences - Agarwal, Sharir, et al. - 1989
67	Approximate matching of polygonal shapes - Alt, Behrends, et al. - 1991
57	Generalized selection and ranking: sorted matrices - Frederickson, Johnson
54	Cascading divide-and-conquer: A technique for designing parallel algorithms - Atallah, Cole, et al. - 1989
48	Algorithms for bichromatic line segment problems and polyhedral terrains - Chazelle, Edelsbrunner, et al.
48	Approximations and optimal geometric divide-and-conquer - Matousek - 1991
47	Efficient hidden surface removal for objects with small union size - Overmars, Katz, et al. - 1992
37	width, closest line-pair, and parametric searching - Chazelle, Edelsbrunner, et al. - 1992
34	The polygon containment problem - Chazelle - 1983
33	Optimal algorithms for tree partitioning - Frederickson - 1991
31	Roundness algorithms using the Voronoi diagrams - Ebara, Fukuyama, et al. - 1989
31	Randomized optimal algorithm for slope selection - Matousek - 1991
25	A singly exponential stratification scheme for real semi--algebraic varieties and its applications - Chazelle, Edelsbrunner, et al. - 1989
23	Using approximation algorithms to design parallel algorithms that may ignore processor allocation - Goodrich - 1991
23	Divide-and-conquer in multidimensional space - Bentley, Shamos - 1976
21	On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space, Discrete Comput - Leven, Sharir - 1987
20	Extremal polygon containment problems - Sharir, Toledo - 1991
19	Selecting distances in the plane - Agarwal, Aronov, et al. - 1990
19	Finding Upper Envelope of n Line Segments - Hershberger - 1989
18	Randomized optimal algorithm for slope selection - Matouˇsek - 1991
15	Planar geometric location problems - Agarwal, Sharir - 1990
15	An algorithm for generalized point location and its applications - Chazelle, Sharir - 1990
12	Efficiently computing the Hausdorff distance for point sets under translation - Huttenlocher, Kedem - 1990
10	Counting circular arc intersections - Agarwal, Sharir - 1991
6	Computing a segment-center for a planar point set - Agarwal, Efrat, et al. - 1991
5	Finding the kth shortest paths and p-centers by generating and searching good data structures - Frederickson, Johnson - 1983
4	Optimal slope selection - Cole, Salowe, et al. - 1989
3	The biggest diagonal in a simple polygon - Aggarwal, Suri - 1990
2	Computing the center of a point set in three dimensions - Naor, Sharir - 1990
2	A polygon cutting theorem - Chazelle - 1982
1	1-Segment covering problem - Imai, Lee, et al. - 1989
1	Extremal polygon containment problems, manuscript - Sharir, Toledo - 1991