Abstract is missing.
- Morphing Planar Graph DrawingsAnna Lubiw. 1
- Note on the Pair-Crossing Number and the Odd-Crossing NumberGéza Tóth. 3-6
- The Harmony of SpheresOtfried Cheong. 7
- Capturing Crossings: Convex Hulls of Segment and Plane IntersectionsEsther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink. 9-11
- Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual GraphsNadia Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. 13-16
- Finding Segments and Triangles Spanned by Points in R:::3:::Steven Bitner, Ovidiu Daescu. 17-20
- On the Fewest Nets Problem for Convex PolyhedraVal Pinciu. 21-24
- Contraction and Expansion of Convex SetsMichael Langberg, Leonard J. Schulman. 25-28
- Improved Upper Bounds on the Reflexivity of Point SetsEyal Ackerman, Oswin Aichholzer, Balázs Keszegh. 29-32
- Computing a planar widest empty alpha-siphon in o(n:::3:::) timeBoaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi. 33-36
- On the Number of Empty Pseudo-Triangles in Point SetsMarc J. van Kreveld, Bettina Speckmann. 37-40
- Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric ComputingStefan Näher, Martin Taphorn. 41-44
- On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum AlgorithmsMarc Mörig, Stefan Schirra. 45-48
- Optimal Point Set Partitioning using Rigid Motion Star PlacementProsenjit Bose, Jason Morrison. 49-52
- Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three CurrenciesBoaz Ben-Moshe, Yefim Dinitz. 53-56
- An Improved Bound for the Affine Sylvester ProblemJonathan Lenchner. 57-60
- The Ordinary Line Problem RevisitedAsish Mukhopadhyay, Eugene Greene. 61-64
- Reconstructing Submanifolds of Euclidean SpaceDavid Letscher. 65-68
- On Unfolding Trees and Polygons on Various LatticesSheung-Hung Poon. 69-72
- Spiralling and Folding: The Topological ViewMarcus Schaefer, Eric Sedgwick, Daniel Stefankovic. 73-76
- Unfolding Polyhedra via Cut-Tree TruncationAlex Benton, Joseph O Rourke. 77-80
- Minimum-sum Dipolar Spanning Tree for Points in R:::3:::Steven Bitner, Ovidiu Daescu. 81-84
- Hamilton Circuits in Hexagonal Grid GraphsKamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao. 85-88
- Realizations of Hexagonal Graph RepresentationsTherese C. Biedl. 89-92
- Conflict-Free Coloring of Points on a Line with respect to a Set of IntervalsMatthew J. Katz, Nissan Lev-Tov, Gila Morgenstern. 93-96
- Weak Conflict-Free Colorings of Point Sets and Simple RegionsBalázs Keszegh. 97-100
- A Lower Bound on the Area of a 3-Coloured Disc PackingPeter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw. 101-104
- Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust AlgorithmJoachim Giesen, Balint Miklos, Mark Pauly. 105-108
- Simplification of Scalar Data via Monotone-Light FactorizationsMartin Brooks, Liam Watson. 109-112
- The Slider-Pinning ProblemAudrey Lee, Ileana Streinu, Louis Theran. 113-116
- Approximating k-hop Minimum Spanning Trees in Euclidean MetricsSören Laue, Domagoj Matijevic. 117-120
- Terminal Steiner Tree with Bounded Edge LengthZhiyong Lin. 121-123
- Image Compression Terrain SimplificationBoaz Ben-Moshe, Liad Serruya, Ariel Shamir. 125-128
- Distance Preserving Terrain Simplification - An Experimental StudyBoaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky. 129-132
- Terrain Representation using Right-Triangulated Irregular NetworksSuddha Basu, Jack Snoeyink. 133-136
- Vertex Pops and PopturnsGreg Aloupis, Brad Ballinger, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Ferran Hurtado, Stefan Langerman, Joseph O Rourke, Perouz Taslakian, Godfried T. Toussaint. 137-140
- On Rolling Cube PuzzlesKevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian. 141-144
- Efficient Snap Rounding with Integer ArithmeticBinay K. Bhattacharya, Jeff Sember. 145-148
- Extending the Power of Snap Rounding VariantsEli Packer. 149-152
- Cache-Oblivious Output-Sensitive Two-Dimensional Convex HullPeyman Afshani, Arash Farzan. 153-155
- Efficient Kinetic Data Structures for MaxCutArtur Czumaj, Gereon Frahling, Christian Sohler. 157-160
- Towards a Definition of Higher Order Constrained Delaunay TriangulationsRodrigo I. Silveira, Marc J. van Kreveld. 161-164
- Vector Weighted Anisotropic Voronoi Diagrams and Delaunay TraingulationsDavid Letscher. 165-168
- Covering Points by Isothetic Unit SquaresPriya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das. 169-172
- A Disk-Covering Problem with Application in Optical InterferometryTrung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, Christian Knauer. 173-176
- Approximations of Geodesic Distances for Incomplete Triangular ManifoldsZouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stefanie Wuhrer. 177-180
- Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity TransformationsDror Aiger, Klara Kedem. 181-184
- Linear-Space Algorithms for Distance Preserving EmbeddingTetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer. 185-188
- Approximate Shortest Descent Path on a TerrainSasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari. 189-192
- A Note on Drawing Direction-constrained Paths in 3DEthan Kim, Sue Whitesides, Giuseppe Liotta. 193-196
- Optimistic and Pessimistic Shortest Paths on Uncertain TerrainsYury Kholondyrev, William Evans. 197-200
- Triangulations Loosing Bundles and WeightCem Boyaci, Hale Erten, Alper Üngör. 201-204
- Computing Acute and Non-obtuse TriangulationsHale Erten, Alper Üngör. 205-208
- On (Pointed) Minimum Weight Pseudo-TriangulationsOswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann. 209-212
- Largest Subsets of Triangles in a TriangulationBoris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. 213-216
- Restricted Edge Contractions in Triangulations of the Sphere with BoundaryMasaki Moriguchi, Kokichi Sugihara. 217-220
- Improved Layouts of the Multigrid NetworkShabnam Aziza, Therese C. Biedl. 221-224
- Straight-line Drawings of Outerplanar Graphs in O(dn log n) AreaFabrizio Frati. 225-228
- On Bus Graph RealizabilityAnil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-Francois Preville-Ratelle, Sue Whitesides, Nuo Yu. 229-232
- Homothetic Triangle Contact Representations of Planar GraphsMelanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta. 233-236
- Pointed Drawings of Planar GraphsOswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber. 237-240
- Generalized Watchman Route Problem with Discrete View CostPengpeng Wang, Ramesh Krishnamurti, Kamal Gupta. 241-244
- Optimal Schedules for 2-guard Room SearchStephen Bahun, Anna Lubiw. 245-248
- Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple PolygonAmirAli Khosravi, Alireza Zarei, Mohammad Ghodsi. 249-252
- Approximation Algorithms for the Minimum-Length Corridor and Related ProblemsArturo Gonzalez-Gutierrez, Teofilo F. Gonzalez. 253-256
- A General and Efficient Representation for Multiresolution Meshes: Application to Quad/Triangle SubdivisionPierre Kraemer, David Cazier, Dominique Bechmann. 257-260
- Practical C:::1::: Reparametrization of Piecewise Rational Bézier CurvesRoman Rolinsky, François Dupret. 261-264
- On a Geometric Approach to the Segment Sum Problem and Its GeneralizationAsish Mukhopadhyay, Eugene Greene. 265-268
- Finding Intersections of Bichromatic Segments Defined by PointsAmr Elmasry, Kazuhisa Makino. 269-272
- Fast Computation of Smallest Enclosing Circle with Center on a Query Line SegmentArindam Karmakar, Sasanka Roy, Sandip Das. 273-276
- Open Problems from CCCG 2006Erik D. Demaine, Joseph O Rourke. 277-280