Technical Reports
A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
34 matches found for Chazelle, Bernard:
- Chazelle, Bernard
- Intersection of Convex Objects in Two and Three Dimensions, TR-025-86, January 1986
- Lower Bounds on the Complexity of Multidimensional Searching, TR-055-86, October 1986
- Linear Space Data Structures for Two Types of Range Search, TR-062-86, November 1986
- An Algorithm for Segment-Dragging and its Implementation, TR-077-87, January 1987
- The Complexity of Cutting Complexes, TR-082-87, March 1987
- Some Techniques for Geometric Searching with Implicit Set Representations, TR-095-97, June 1987
- Computing on a Free Tree Via Complexity-Preserving Mappings, TR-096-87, June 1987
- An Optimal Algorithm for Intersecting Line Segments in the Plane, TR-148-88, April 1988
- Tight Bounds on the Stabbing Number of Spanning Trees in Euclidean Space, TR-155-88, May 1988
- Lower Bounds on the Complexity of Polytope Range Searching , TR-166-88, June 1988
- Visibility and Intersection Problems in Plane Geometry, TR-167-88, June 1988
- A Deterministic View of Random Sampling and its Use in Geometry , TR-181-88, September 1988
- An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra, TR-205-89, February 1989
- Triangulating A Nonconvex Polytope, TR-227-89, August 1989
- Efficient Polygon Triangulation, TR-249-90, February 1990
- Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains, TR-252-90, March 1990
- Slimming Down by Adding: Selecting Heavily Covered Points, TR-257-90, April 1990
- Triangulating a Simple Polygon in Linear Time, TR-264-90, May 1990
- Counting and Cutting Cycles of Lines and Rods in Space, TR-288-90, October 1990
- Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems, TR-290-90, October 1990
- Lines in Space: Combinatorics and Algorithms, TR-294-90, January 1990
- Point Location Among Hyperplanes and Unidirectional Ray-Shooting, TR-333-91, June 1991
- Computing a Face in an Arrangement of Line Segments and Related Problems, TR-334-91, June 1991
- Cutting Hyperplanes for Divide-and-Conquer, TR-335-91, June 1991
- An Optimal Convex Hull Algorithm for Points Sets in Any Fixed Dimension, TR-336-91, June 1991
- Ray Shooting in Polygons Using Geodesic Triangulations, TR-350-91, September 1991
- Derandomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions, TR-358-91, December 1991
- Randomizing an Output-Sensitive Convex Hull Algorithm in Three Dimensions, TR-361-92, February 1992
- The New Jersey Line-Segment-Saw Massacre (Companion to Video), TR-379-92, July 1992
- On Linear-time Deterministic Algorithms for Optimization Problems in Fixed Dimension, TR-393-92, October 1992
- Quasi-Orthogonality via Finite-Differencing: An Elementary Approach to Geometric Discrepancy, TR-407-93, February 1993
- On Linear-time Deterministic Algorithms for Optimization Problems in Fixed Dimension, TR-413-93, March 1993
- Application Challenges to Computational Geometry: CG Impact Task Force Report, TR-521-96, April 1996
- Strategies for Polyhedral Surface Decomposition: An Experimental Study, TR-564-95, December 1995
