Applications of Random Sampling in Computational Geometry, II.
K.L. Clarkson, Peter W. Shor (1989)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Applications of Random Sampling to On-Line Algorithms in Computational Geometry.”
Applications of Random Sampling in Computational Geometry, II.
New Applications of Random Sampling in Computational Geometry.
K.L. Clarkson (1987)
Discrete & computational geometry
Similarity:
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.
H. Edelsbrunner, L.J. Guibas, M. Sharir (1990)
Discrete & computational geometry
Similarity:
Implicitly Representing Arrangements of Lines or Segments.
H. Edelsbrunner, Raimund Seidel, Micha Sharir, Leonidas Guibas, John Hershberger, Jack, Welzl, Emo Snoeyink (1989)
Discrete & computational geometry
Similarity:
Polygonizations of Point Sets in the Plane.
L. Deneen, Gary Shute (1988)
Discrete & computational geometry
Similarity:
Constructing Arrangements Optimally in Parallel.
M.T. Goodrich (1993)
Discrete & computational geometry
Similarity:
Computing Simple Circuits from a Set of Line Segments.
D. Rappaport, H. Imai, G.T. Toussaint (1990)
Discrete & computational geometry
Similarity:
On Lazy Randomized Incremental Construction.
O. Schwarzkopf, M. de Berg, K. Dobrindt (1995)
Discrete & computational geometry
Similarity:
Visibility and Intersection Problems in Plane Geometry.
B. Chazelle, Leonidas J. Guibas (1989)
Discrete & computational geometry
Similarity:
Two Combinatorial Problems in the Plane.
P. Erdös, G. Purdy (1995)
Discrete & computational geometry
Similarity:
Construction of e-Nets.
J. Matousek (1990)
Discrete & computational geometry
Similarity: