DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Parametric search
Parametric search
The Geodesic $2 $-Center Problem in a Simple Polygon
Walking Your Dog in the Woods in Polynomial Time Erin Wolf Chambers, Eric Colin De Verdire, Jeff Erickson, Sylvain Lazard, Francis Lazarus, Shripad Thite
Cole's Parametric Search
Parametric Search Made Practical
44 RANDOMIZATION and DERANDOMIZATION Otfried Cheong, Ketan Mulmuley, and Edgar Ramos
In-Place Randomized Slope Selection
An Efficient Search Algorithm for Minimum Covering Polygons on the Sphere∗
Los Alamos New Mexico 87545 Network Improvement Problems
Cole's Parametric Search Technique Made Practical
30 POLYGONS Joseph O’Rourke, Subhash Suri, and Csaba D
Geodesic Fréchet Distance Inside a Simple Polygon Atlas Cook Iv, Carola Wenk
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs David Fernández-Baca Iowa State University,
[email protected]
A New Modular Parametric Search Framework
CS-1996-05 Range Searching1 Pankaj K. Agarwal2 Department Of
Ray Shooting and Parametric Search *
João Pedro Teixeira Brandão Parametric Search For
Ray Shooting and Parametric Search*
Algorithm Engineering in Geometric Network Planning and Data Mining
Top View
Parametric and Kinetic Minimum Spanning Trees
Optimal Parametric Search on Graphs of Bounded Tree-Width David Fernández-Baca Iowa State University,
[email protected]
Optimal Parametric Search on Graphs of Bounded Tree-Width David Fernández-Baca Iowa State University,
[email protected]
On N Processors. (The Basic Algorithm Was Preparata's
Geodesic Fréchet Distance Inside a Simple Polygon∗
Efficient Algorithms for Geometric Optimization PANKAJ K
In-Place Randomized Slope Selection
Experimental Evaluation of Parametric Search Algorithms
Efficient Randomized Algorithms for the Repeated Median Line Estimator
Parametric Search Visualization
Parametric and Kinetic Minimum Spanning Trees
40 RANGE SEARCHING Pankaj K
Downloadable PDF Program
Notes on Computing Peaks in K-Levels and Parametric Spanning Trees
An Exact Implementation Using Parametric Search∗