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