-
TR-334-91 -
Computing a Face in an Arrangement of Line Segments and Related Problems
(1991-06-00)
Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas / Sharir, Micha / Snoeyink, Jack
-
TR-350-91 -
Ray Shooting in Polygons Using Geodesic Triangulations
(1991-09-00)
Grigni, Michelangelo / Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas / Hershberger, John / Sharir, Micha / Snoeyink, Jack
-
TR-039-86 -
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons
(1986-05-00)
Leven, Daniel / Tarjan, Robert E. / Guibas, Leonidas / Hershberger, John / Sharir, Micha
-
TR-082-87 -
The Complexity of Cutting Complexes
(1987-03-00)
Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas
-
TR-152-88 -
An Efficient Algorithm for Finding the CSG Representation of a Simple Polygon
(1988-05-00)
Dobkin, David P. / Guibas, Leonidas / Hershberger, John / Snoeyink, Jack
-
TR-167-88 -
Visibility and Intersection Problems in Plane Geometry
(1988-06-00)
Chazelle, Bernard / Guibas, Leonidas
-
TR-252-90 -
Algorithms for Bichromatic Line Segment Problems and Polyhedral Terrains
(1990-03-00)
Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas / Sharir, Micha
-
TR-257-90 -
Slimming Down by Adding: Selecting Heavily Covered Points
(1990-04-00)
Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas / Hershberger, John / Sharir, Micha / Seidel, Raimund
-
TR-288-90 -
Counting and Cutting Cycles of Lines and Rods in Space
(1990-10-00)
Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas / Sharir, Micha / Snoeyink, Jack / Pollack, Richard / Seidel, Raimund
-
TR-294-90 -
Lines in Space: Combinatorics and Algorithms
(1990-01-00)
Chazelle, Bernard / Edelsbrunner, Herbert / Guibas, Leonidas / Sharir, Micha / Stolfi, Jorge