Full versions of the SoCG97 papers
(Sorted by name of 1st author)
...and their authors
Full versions of the SoCG96 papers
(Sorted by name of 1st author)
...and their authors
Nina Amenta and G"unter
Ziegler
Shadows
and Slices of Polytopes
Chandrajit L. Bajaj
and Valerio Pascucci
Splitting
a Complex of Convex Polytopes in any Dimension
Gill Barequet,Matthew
Dickerson and David Eppstein
On
Triangulating Three-Dimensional Polygons
Mark de Berg,
Mark van Kreveld, Rene
van Oostrum and Mark Overmars
Simple
Traversal of a Subdivision Without Extra Storage
Guy Blelloch, Gary
L. Miller and Dafna Talmor
Developing a Practical
Projection-Based Parallel Delaunay Algorithm
Jean-Daniel
Boissonnat and Sylvain
Lazard
A polynomial-time
algorithm for computing a shortest path of bounded curvature amidst moderate
obstacles
Marek Chrobak, Michael
T. Goodrich and Roberto Tamassia
Convex Drawings
of Graphs in Two and Three Dimensions
Satyan Coorg and
Seth Teller
Temporally
Coherent Conservative Visibility
Alon Efrat and Alon
Itai
Improvements
on Bottleneck Matching and Related Problems Using Geometry
David Eppstein
Linear
Complexity Hexahedral Mesh Generation
Stefan Felsner
On the
Number of Arrangements of Pseudolines
Sariel Har-Peled, Micha
Sharir, and Kasturi R. Varadarajan
Approximate
Shortest Paths on a Convex Polytope in Three Dimensions
Jeff Erickson New
Lower Bounds for Convex Hull Problems in Odd Dimensions
Matya Katz and
Franck
Nielsen
On piercing
set of objects
Scott Mitchell and Steve
Vavasis An
aspect ratio bound for triangulating a d-grid cut by a hyperplane
Ernst P. Mucke, Isaac
Saias and Binhai Zhu Fast
Randomized Point Location Without Preprocessing in Two- and Three-dimensional
Delaunay Triangulations
G. Ramkumar
An Algorithm
to Compute the Minkowski Sum Outer-Face of Two Simple Polygons
Kathleen Romanik
and Sven Schuierer
Optimal Robot Localization
in Trees
Micha Sharir and Emo
Welzl Rectilinear
and Polygonal $p$-Piercing and $p$-Center Problems"
Otfried Schwarzkopf
and Micha Sharir
Vertical Decomposition
of a Single Cell in a Three-Dimensional Arrangement of Surfaces and its
Applications
Micha Sharir
A Near-Linear
Algorithm for the Planar 2-Center Problem
Jonathan Richard Shewchuk
Robust Predicates Web
page
Daniel
A. Spielman and Shang-Hua Teng,
Disk Packings and Planar Separators
Authors (Sorted alphabetic)
Oswin Aichholzer
Nina Amenta
Mark de Berg
Chandrajit L. Bajaj
Gill Barequet
Guy Blelloch,
Jean-Daniel
Boissonnat
Herve Bronnimann
Marek Chrobak
Jonathan Cohen
Satyan Coorg
Matthew Dickerson
Bruce Randall Donald
David Eppstein
Alon Efrat
Jeff Erickson
Stefan Felsner
Bernd G"artner
Michael T. Goodrich
Sariel Har-Peled
Tom Hudson
Alon Itai
Matya Katz
Klara Kedem
Mark van Kreveld
Sylvain Lazard
Ming Lin
Dinesh Manocha
Gary L. Miller
Ernst P. Mucke
Franck
Nielsen
Rene van Oostrum
Mark Overmars
Valerio Pascucci
Michel Pocchiola
G. Ramkumar
Kathleen
Romanik
Stefan Schirra
Sven Schuierer
J"org
Schwerdt
Otfried Schwarzkopf
Micha Sharir
Michiel
Smid
Roberto Tamassia
Seth Teller
G"unter Ziegler