Conferences in DBLP
Wolfgang Mulzer , Günter Rote Minimum weight triangulation is NP-hard. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:1-10 [Conf ] Sunil Arya , Theocharis Malamatos , David M. Mount The effect of corners on the complexity of approximate range searching. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:11-20 [Conf ] Yulai Xie , Jack Snoeyink , Jinhui Xu Efficient algorithm for approximating maximum inscribed sphere in high dimensional polytope. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:21-29 [Conf ] Yevgeny Schreiber , Micha Sharir An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:30-39 [Conf ] Mathieu Desbrun Discrete differential forms and applications to surface tiling. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:40- [Conf ] Noga Alon , Shakhar Smorodinsky Conflict-free colorings of shallow discs. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:41-43 [Conf ] Ke Chen How to play a coloring game against a color-blind adversary. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:44-51 [Conf ] Haim Kaplan , Micha Sharir , Elad Verbin Colored intersection searching via sparse rectangular matrix multiplication. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:52-60 [Conf ] Robert Connelly , Erik D. Demaine , Martin L. Demaine , Sándor P. Fekete , Stefan Langerman , Joseph S. B. Mitchell , Ares Ribó , Günter Rote Locked and unlocked chains of planar shapes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:61-70 [Conf ] Hayley N. Iben , James F. O'Brien , Erik D. Demaine Refolding planar polygons. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:71-79 [Conf ] Kevin Buchin , Maike Buchin , Carola Wenk Computing the Fréchet distance between simple polygons in polynomial time. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:80-87 [Conf ] Boris Aronov , Mark de Berg , Chris Gray Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:88-94 [Conf ] Esther Ezra , Micha Sharir , Alon Efrat On the ICP algorithm. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:95-104 [Conf ] Marc Glisse An upper bound on the average size of silhouettes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:105-111 [Conf ] Frédéric Chazal , André Lieutier Topology guaranteeing manifold reconstruction using distance function to noisy data. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:112-118 [Conf ] David Cohen-Steiner , Herbert Edelsbrunner , Dmitriy Morozov Vines and vineyards by updating persistence in linear time. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:119-126 [Conf ] Herbert Edelsbrunner , Dmitriy Morozov , Valerio Pascucci Persistence-sensitive simplification functions on 2-manifolds. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:127-134 [Conf ] Gereon Frahling , Christian Sohler A fast k-means implementation using coresets. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:135-143 [Conf ] David Arthur , Sergei Vassilvitskii How slow is the k -means method? [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:144-153 [Conf ] Rajeev Motwani , Assaf Naor , Rina Panigrahy Lower bounds on locality sensitive hashing. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:154-157 [Conf ] Lars Arge , Norbert Zeh Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:158-166 [Conf ] Pankaj K. Agarwal , Lars Arge , Ke Yi I/O-efficient batched union-find and its applications to terrain analysis. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:167-176 [Conf ] Esther Moet , Marc J. van Kreveld , A. Frank van der Stappen On realistic terrains. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:177-186 [Conf ] Mihai Badoiu , Julia Chuzhoy , Piotr Indyk , Anastasios Sidiropoulos Embedding ultrametrics into low-dimensional spaces. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:187-196 [Conf ] MohammadHossein Bateni , Mohammad Taghi Hajiaghayi , Erik D. Demaine , Mohammad Moharrami Plane embeddings of planar graph metrics. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:197-206 [Conf ] James R. Lee Volume distortion for subsets of Euclidean spaces: extended abstract. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:207-216 [Conf ] Chee-Keng Yap Complete subdivision algorithms, I: intersection of Bezier curves. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:217-226 [Conf ] Ioannis Z. Emiris , Elias P. Tsigaridas , George M. Tzoumas The predicates for the Voronoi diagram of ellipses. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:227-236 [Conf ] Victor Milenkovic , Elisha Sacks An approximate arrangement algorithm for semi-algebraic curves. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:237-246 [Conf ] Ke Chen , Sariel Har-Peled The orienteering problem in the plane revisited. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:247-254 [Conf ] János Pach , Géza Tóth Degenerate crossing numbers. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:255-258 [Conf ] Eyal Ackerman On the maximum number of edges in topological graphs with no four pairwise crossing edges. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:259-263 [Conf ] Rolf Klein , Martin Kutz The density of iterated crossing points and a gap result for triangulations of finite point sets. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:264-272 [Conf ] Micha Sharir , Emo Welzl Random triangulations of planar point sets. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:273-281 [Conf ] Oswin Aichholzer , Franz Aurenhammer , Thomas Hackl Pre-triangulations and liftable complexes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:282-291 [Conf ] Daniel K. Blandford , Guy E. Blelloch , Clemens Kadow Engineering a compact parallel delaunay algorithm in 3D. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:292-300 [Conf ] Boris Aronov , Paz Carmi , Matthew J. Katz Minimum-cost load-balancing partitions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:301-308 [Conf ] Luca Castelli Aleardi , Olivier Devillers , Gilles Schaeffer Optimal succinct representations of planar maps. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:309-318 [Conf ] Frédéric Chazal , David Cohen-Steiner , André Lieutier A sampling theory for compact sets in Euclidean space. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:319-326 [Conf ] Joachim Giesen , Edgar A. Ramos , Bardia Sadri Medial axis approximation and unstable flow complex. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:327-336 [Conf ] Jean-Daniel Boissonnat , Steve Oudot Provably good sampling and meshing of Lipschitz surfaces. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:337-346 [Conf ] François Labelle Sliver removal by lattice refinement. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:347-356 [Conf ] John Hershberger Improved output-sensitive snap rounding. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:357-366 [Conf ] Eli Packer Iterated snap rounding with bounded drift. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:367-376 [Conf ] Stefan Funke , Christian Klein Hole detection or: "how much geometry hides in connectivity?". [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:377-385 [Conf ] Bernard Chazelle , C. Seshadhri Online geometric reconstruction. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:386-394 [Conf ] Vladlen Koltun , Micha Sharir On overlays and minimization diagrams. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:395-401 [Conf ] Sariel Har-Peled How to get close to the median shape. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:402-410 [Conf ] Nico Kruithof , Gert Vegter Envelope surfaces. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:411-420 [Conf ] Erin W. Chambers , Éric Colin de Verdière , Jeff Erickson , Francis Lazarus , Kim Whittlesey Splitting (complicated) surfaces is hard. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:421-429 [Conf ] Martin Kutz Computing shortest non-trivial cycles on orientable surfaces of bounded genus in almost linear time. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:430-438 [Conf ] David W. Krumme , Eynat Rafalin , Diane L. Souvaine , Csaba D. Tóth Tight bounds for connecting sites across barriers. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:439-448 [Conf ] Helmut Alt , Esther M. Arkin , Hervé Brönnimann , Jeff Erickson , Sándor P. Fekete , Christian Knauer , Jonathan Lenchner , Joseph S. B. Mitchell , Kim Whittlesey Minimum-cost coverage of point sets by disks. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:449-458 [Conf ] Esther M. Arkin , Gill Barequet , Joseph S. B. Mitchell Algorithms for two-box covering. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:459-467 [Conf ] L. Paul Chew Exact computation of protein structure similarity. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:468-474 [Conf ] Sándor P. Fekete , Alexander Kröller Geometry-based reasoning for a large sensor network. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:475-476 [Conf ] Amit Mhatre , Piyush Kumar Projective clustering and its application to surface reconstruction: extended abstract. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:477-478 [Conf ] Ming-Hung Tsai , Jyh-Da Wei , Jeng-Hung Huang , D. T. Lee A portable geometric algorithm visualization system with dynamic camera positioning for tracking 3D objects. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:479-480 [Conf ] Martin Isenburg , Yuanxin Liu , Jonathan Richard Shewchuk , Jack Snoeyink Illustrating the streaming construction of 2D delaunay triangulations. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:481-482 [Conf ] Ovidiu Daescu , Joseph S. B. Mitchell , Simeon C. Ntafos , James D. Palmer , Chee-Keng Yap Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:483-484 [Conf ] Frank Nielsen , Richard Nock On approximating the smallest enclosing Bregman Balls. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 2006, pp:485-486 [Conf ]