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