Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,174
Ray shooting and parametric search
, 1993
"... Efficient algorithms for the ray shooting problem are presented: Given a collection F of objects in d, build a data structure so that, for a query ray, the first object of F hit by the ray can be quickly determined. Using the parametric search technique, this problem is reduced to the segment emptin ..."
Abstract
-
Cited by 126 (22 self)
- Add to MetaCart
Efficient algorithms for the ray shooting problem are presented: Given a collection F of objects in d, build a data structure so that, for a query ray, the first object of F hit by the ray can be quickly determined. Using the parametric search technique, this problem is reduced to the segment
Parametric Search Package: Tutorial
, 2005
"... This document is the tutorial of the CGAL extension package for parametric search. It gives an overview of the parametric-search framework, and explains how to use it by describing implementations of several applications of parametric search. The full documentation of all classes and functions that ..."
Abstract
- Add to MetaCart
This document is the tutorial of the CGAL extension package for parametric search. It gives an overview of the parametric-search framework, and explains how to use it by describing implementations of several applications of parametric search. The full documentation of all classes and functions
Parametric search made practical
- SoCG: 18th Symposium on Computational Geometry
, 2002
"... In this paper we show that in sorting-based applications of parametric search, Quicksort can replace the parallel sorting algorithms that are usually advocated, and we argue that Cole’s optimization of certain parametric-search algorithms may be unnecessary under realistic assumptions about the inpu ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
In this paper we show that in sorting-based applications of parametric search, Quicksort can replace the parallel sorting algorithms that are usually advocated, and we argue that Cole’s optimization of certain parametric-search algorithms may be unnecessary under realistic assumptions about
Parametric Search Visualization
"... This video provides a visualization of parametric search using as the underlying application an algorithm for computing a tangent to a level in arrangement proposed by Matouˇsek [2]. The visualization is based on the framework of van Oostrum and Veltkamp [6], which simplifies considerably the implem ..."
Abstract
- Add to MetaCart
This video provides a visualization of parametric search using as the underlying application an algorithm for computing a tangent to a level in arrangement proposed by Matouˇsek [2]. The visualization is based on the framework of van Oostrum and Veltkamp [6], which simplifies considerably
Applications of parametric searching in geometric optimization
- J. Algorithms
, 1994
"... z Sivan Toledo x ..."
Optimal Parametric Search on Graphs of Bounded Tree-width
, 1994
"... We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs. ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on planar graphs.
1 Introduction Parametric Search Using CGAL £ (abstract)
"... Parametric search, the optimization technique by Megiddo [2], computes a value λ £ that optimizes an ..."
Abstract
- Add to MetaCart
Parametric search, the optimization technique by Megiddo [2], computes a value λ £ that optimizes an
Results 1 - 10
of
1,174
