Conferences in DBLP
Mark de Berg , René van Oostrum , Mark H. Overmars Simple Traversal of a Subdivision Without Extra Storage. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-5 [Conf ] Klara Kedem , Yana Yarmovski Curve Based Stereo Matching Using the Minimum Hausdorff Distance. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-15 [Conf ] Tsuyoshi Ono , Yoshiaki Kyoda , Tomonari Masada , Kazuyoshi Hayase , Tetsuo Shibuya , Motoki Nakade , Mary Inaba , Hiroshi Imai , Keiko Imai , David Avis A Package for Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-17 [Conf ] Mary Inaba , Hiroshi Imai , Naoki Katoh Experimental Results of Randomized Clustering Algorithm. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-1 [Conf ] Ferran Hurtado , Marc Noy The Graph of Triangulations of a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-7 [Conf ] Martin Held , James T. Klosowski , Joseph S. B. Mitchell Collision Detection for Fly-Throughs in Virtual Environments. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-13 [Conf ] Sherif Ghali , A. James Stewart Maintenance of the Set of Segments Visible from a Moving Viewpoint in Two Dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-3 [Conf ] Elmar Schömer , Jürgen Sellen , Marek Teichmann , Chee-Keng Yap Smallest Enclosing Cylinders. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-13 [Conf ] Matthew Dickerson , Daniel Scharstein The Rotation Diagram and Optimal Containing Placements of a Convex Polygon. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-9 [Conf ] Frédo Durand , Rachel Orti , Stéphane Rivière , Claude Puech Radiosity in Flatland Made Visibly Simple: Using the Visibility Complex for Lighting Simulation of Dynamic Scenes in Flatland. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-11 [Conf ] Subodh Kumar , Dinesh Manocha The Power of Coherence: Fast Tessellation of Surfaces. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-15 [Conf ] Brian Mirtich , John F. Canny Testing Control Systems Through Dynamic Simulation. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-5 [Conf ] Nina Amenta Four-Polytopes and a Funeral (for my conjecture). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-1 [Conf ] Chandrasekhar Pisupati , Lawrence B. Wolff , Wayne Mitzner , Elias A. Zerhouni Geometric Tree Matching with Applications to 3D Lung Structures. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-19 [Conf ] David Avis , Prosenjit Bose , Godfried T. Toussaint , Thomas C. Shermer , Binhai Zhu , Jack Snoeyink On the Sectional Area of Convex Polytopes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-11 [Conf ] James E. Baker , Isabel F. Cruz , Giuseppe Liotta , Roberto Tamassia Animating Geometric Algorithms Over the Web. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-3 [Conf ] Gill Barequet , Micha Sharir Partial Surface Matching by Using Directed Footprints. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-9 [Conf ] Patrice Belleville , J. Mark Keil , Michael McAllister , Jack Snoeyink On Computing Edges That Are In All Minimum-Weight Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:0-7 [Conf ] Jeff Erickson New Lower Bounds for Convex Hull Problems in Odd Dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:1-9 [Conf ] Nina Amenta , Günter M. Ziegler Shadows and Slices of Polytopes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:10-19 [Conf ] Otfried Schwarzkopf , Micha Sharir Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:20-29 [Conf ] Stefan Felsner On the Number of Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:30-37 [Conf ] Gill Barequet , Matthew Dickerson , David Eppstein On Triangulating Three-Dimensional Polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:38-47 [Conf ] Scott A. Mitchell , Stephen A. Vavasis An Aspect Ratio Bound for Triangulating a d -Grid Cut by a Hyperplane (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:48-57 [Conf ] David Eppstein Linear Complexity Hexahedral Mesh Generation. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:58-67 [Conf ] Sandy Irani , Prabhakar Raghavan Combinatorial and Experimental Results for Randomized Point Matching Algorithms. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:68-77 [Conf ] Satyan R. Coorg , Seth J. Teller Temporally Coherent Conservative Visibility (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:78-87 [Conf ] Chandrajit L. Bajaj , Valerio Pascucci Splitting a Complex of Convex Polytopes In Any Dimension. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:88-97 [Conf ] Robert J. Lang A Computational Algorithm for Origami Design. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:98-105 [Conf ] Micha Sharir A Near-Linear Algorithm for the Planar 2-Center Problem. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:106-112 [Conf ] Matthew J. Katz , Frank Nielsen On Piercing Sets of Objects. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:113-121 [Conf ] Micha Sharir , Emo Welzl Rectilinear and Polygonal p -Piercing and p -Center Problems. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:122-132 [Conf ] Wei Chen , Koichi Wada , Kimio Kawaguchi Parallel Robust Algorithms for Constructing Strongly Convex Hulls. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:133-140 [Conf ] Jonathan Richard Shewchuk Robust Adaptive Floating-Point Geometric Predicates. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:141-150 [Conf ] Simon Kahan , Jack Snoeyink On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:151-158 [Conf ] Kurt Mehlhorn , Stefan Näher , Thomas Schilz , Stefan Schirra , Michael Seel , Raimund Seidel , Christian Uhrig Checking Geometric Programs or Verification of Geometric Structures. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:159-165 [Conf ] Nancy M. Amato , Edgar A. Ramos On Computing Voronoi Diagrams by Divide-Prune-and-Conquer. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:166-175 [Conf ] Neelima Gupta , Sandeep Sen Faster Output-Sensitive Parallel Convex Hulls for d <=3: Optimal Sublogarithmic Algorithms for Small Outputs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:176-185 [Conf ] Guy E. Blelloch , Gary L. Miller , Dafna Talmor Developing a Practical Projection-Based Parallel Delaunay Algorithm. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:186-195 [Conf ] Siu-Wing Cheng , Yin-Feng Xu Approaching the Largest beta-Skeleton within a Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:196-203 [Conf ] Matthew Dickerson , Mark H. Montague A (Usually?) Connected Subgraph of the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:204-213 [Conf ] Ferran Hurtado , Marc Noy , Jorge Urrutia Flipping Edges in Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:214-223 [Conf ] Tomonari Masada , Hiroshi Imai , Keiko Imai Enumeration of Regular Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:224-233 [Conf ] G. D. Ramkumar An Algorithm to Compute the Minkowski Sum Outer-face of Two Simple Polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:234-241 [Conf ] Jean-Daniel Boissonnat , Sylvain Lazard A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:242-251 [Conf ] Tetsuo Asano , David G. Kirkpatrick , Chee-Keng Yap d _{1} -Optimal Motion for a Rod (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:252-263 [Conf ] Kathleen Romanik , Sven Schuierer Optimal Robot Localization in Trees. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:264-273 [Conf ] Ernst P. Mücke , Isaac Saias , Binhai Zhu Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:274-283 [Conf ] Timothy M. Chan Fixed-Dimensional Linear Programming Queries Made Easy. [Citation Graph (1, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:284-290 [Conf ] Michel Pocchiola , Gert Vegter Pseudo-Triangulations: Theory and Applications. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:291-300 [Conf ] Alon Efrat , Alon Itai Improvements on Bottleneck Matching and Related Problems Using Geometry. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:301-310 [Conf ] Kasturi R. Varadarajan Approximating Monotone Polygonal Curves Using the Uniform Metric. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:311-318 [Conf ] Marek Chrobak , Michael T. Goodrich , Roberto Tamassia Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:319-328 [Conf ] Sariel Har-Peled , Micha Sharir , Kasturi R. Varadarajan Approximating Shortest Paths on a Convex Polytope in Three Dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:329-338 [Conf ] Joonsoo Choi , Chee-Keng Yap Monotonicity of Rectilinear Geodesics in d -Space (Extended Abstract). [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:339-348 [Conf ] Daniel A. Spielman , Shang-Hua Teng Disk Packings and Planar Separators. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:349-358 [Conf ] Gyula Károlyi , János Pach , Géza Tóth Ramsey-Type Results for Geometric Graphs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1996, pp:359-365 [Conf ]