default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19. CCCG 2007: Carleton University, Ottawa, Canada
- Prosenjit Bose:
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, CCCG 2007, August 20-22, 2007, Carleton University, Ottawa, Canada. Carleton University, Ottawa, Canada 2007, ISBN 978-0-7709-0520-0
Invited Talks
- Anna Lubiw:
Morphing Planar Graph Drawings. 1 - Géza Tóth:
Note on the Pair-Crossing Number and the Odd-Crossing Number. 3-6 - Otfried Cheong:
The Harmony of Spheres. 7
Session 1A
- Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoeyink:
Capturing Crossings: Convex Hulls of Segment and Plane Intersections. 9-11 - Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. 13-16 - Steven Bitner, Ovidiu Daescu:
Finding Segments and Triangles Spanned by Points in R3. 17-20 - Val Pinciu:
On the Fewest Nets Problem for Convex Polyhedra. 21-24 - Michael Langberg, Leonard J. Schulman:
Contraction and Expansion of Convex Sets. 25-28
Session 1B
- Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
Improved Upper Bounds on the Reflexivity of Point Sets. 29-32 - Boaz Ben-Moshe, Binay K. Bhattacharya, Sandip Das, Daya Ram Gaur, Qiaosheng Shi:
Computing a planar widest empty alpha-siphon in o(n3) time. 33-36 - Marc J. van Kreveld, Bettina Speckmann:
On the Number of Empty Pseudo-Triangles in Point Sets. 37-40 - Stefan Näher, Martin Taphorn:
Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. 41-44 - Marc Mörig, Stefan Schirra:
On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms. 45-48
Session 3A
- Prosenjit Bose, Jason Morrison:
Optimal Point Set Partitioning using Rigid Motion Star Placement. 49-52 - Boaz Ben-Moshe, Yefim Dinitz:
Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies. 53-56 - Jonathan Lenchner:
An Improved Bound for the Affine Sylvester Problem. 57-60 - Asish Mukhopadhyay, Eugene Greene:
The Ordinary Line Problem Revisited. 61-64
Session 3B
- David Letscher:
Reconstructing Submanifolds of Euclidean Space. 65-68 - Sheung-Hung Poon:
On Unfolding Trees and Polygons on Various Lattices. 69-72 - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Spiralling and Folding: The Topological View. 73-76 - Alex Benton, Joseph O'Rourke:
Unfolding Polyhedra via Cut-Tree Truncation. 77-80
Session 4A
- Steven Bitner, Ovidiu Daescu:
Minimum-sum Dipolar Spanning Tree for Points in R3. 81-84 - Kamrul Islam, Henk Meijer, Yurai Núñez Rodríguez, David Rappaport, Henry Xiao:
Hamilton Circuits in Hexagonal Grid Graphs. 85-88 - Therese Biedl:
Realizations of Hexagonal Graph Representations. 89-92
Session 4B
- Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern:
Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. 93-96 - Balázs Keszegh:
Weak Conflict-Free Colorings of Point Sets and Simple Regions. 97-100 - Peter Brass
, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw:
A Lower Bound on the Area of a 3-Coloured Disc Packing. 101-104
Session 5A
- Joachim Giesen, Balint Miklos, Mark Pauly:
Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm. 105-108 - Martin Brooks, Liam Watson:
Simplification of Scalar Data via Monotone-Light Factorizations. 109-112 - Audrey Lee, Ileana Streinu, Louis Theran:
The Slider-Pinning Problem. 113-116 - Sören Laue, Domagoj Matijevic:
Approximating k-hop Minimum Spanning Trees in Euclidean Metrics. 117-120 - Zhiyong Lin:
Terminal Steiner Tree with Bounded Edge Length. 121-123
Session 5B
- Boaz Ben-Moshe, Liad Serruya, Ariel Shamir:
Image Compression Terrain Simplification. 125-128 - Boaz Ben-Moshe, Matthew J. Katz, Igor Zaslavsky:
Distance Preserving Terrain Simplification - An Experimental Study. 129-132 - Suddha Basu, Jack Snoeyink:
Terrain Representation using Right-Triangulated Irregular Networks. 133-136 - Greg 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:
Vertex Pops and Popturns. 137-140 - Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian:
On Rolling Cube Puzzles. 141-144
Session 7A
- Binay K. Bhattacharya, Jeff Sember:
Efficient Snap Rounding with Integer Arithmetic. 145-148 - Eli Packer:
Extending the Power of Snap Rounding Variants. 149-152 - Peyman Afshani, Arash Farzan:
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. 153-155 - Artur Czumaj, Gereon Frahling, Christian Sohler:
Efficient Kinetic Data Structures for MaxCut. 157-160
Session 7B
- Rodrigo I. Silveira, Marc J. van Kreveld:
Towards a Definition of Higher Order Constrained Delaunay Triangulations. 161-164 - David Letscher:
Vector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations. 165-168 - Priya Ranjan Sinha Mahapatra, Partha P. Goswami, Sandip Das:
Covering Points by Isothetic Unit Squares. 169-172 - Trung Nguyen, Jean-Daniel Boissonnat, Frédéric Falzon, Christian Knauer:
A Disk-Covering Problem with Application in Optical Interferometry. 173-176
Session 8A
- Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stefanie Wuhrer:
Approximations of Geodesic Distances for Incomplete Triangular Manifolds. CCCG 2007: 177-180 - Dror Aiger, Klara Kedem:
Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations. 181-184 - Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
Linear-Space Algorithms for Distance Preserving Embedding. 185-188
Session 8B
- Sasanka Roy, Sachin Lodha, Sandip Das, Anil Maheshwari:
Approximate Shortest Descent Path on a Terrain. 189-192 - Ethan Kim, Sue Whitesides, Giuseppe Liotta:
A Note on Drawing Direction-constrained Paths in 3D. 193-196 - Yury Kholondyrev, William Evans:
Optimistic and Pessimistic Shortest Paths on Uncertain Terrains. 197-200
Session 9A
- Cem Boyaci, Hale Erten, Alper Üngör:
Triangulations Loosing Bundles and Weight. 201-204 - Hale Erten, Alper Üngör:
Computing Acute and Non-obtuse Triangulations. 205-208 - Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann:
On (Pointed) Minimum Weight Pseudo-Triangulations. 209-212 - Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira:
Largest Subsets of Triangles in a Triangulation. 213-216 - Masaki Moriguchi, Kokichi Sugihara:
Restricted Edge Contractions in Triangulations of the Sphere with Boundary. 217-220
Session 9B
- Shabnam Aziza, Therese Biedl:
Improved Layouts of the Multigrid Network. 221-224 - Fabrizio Frati:
Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. 225-228 - Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu:
On Bus Graph Realizability. 229-232 - Melanie Badent, Carla Binucci, Emilio Di Giacomo, Walter Didimo, Stefan Felsner, Francesco Giordano, Jan Kratochvíl, Pietro Palladino, Maurizio Patrignani, Francesco Trotta:
Homothetic Triangle Contact Representations of Planar Graphs. 233-236 - Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber:
Pointed Drawings of Planar Graphs. 237-240
Session 11A
- Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta:
Generalized Watchman Route Problem with Discrete View Cost. 241-244 - Stephen Bahun, Anna Lubiw:
Optimal Schedules for 2-guard Room Search. 245-248 - Amirali Khosravi, Alireza Zarei, Mohammad Ghodsi:
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon. 249-252
Session 11B
- Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez:
Approximation Algorithms for the Minimum-Length Corridor and Related Problems. 253-256 - Pierre Kraemer, David Cazier, Dominique Bechmann:
A General and Efficient Representation for Multiresolution Meshes: Application to Quad/Triangle Subdivision. 257-260 - Roman Rolinsky, François Dupret:
Practical C1 Reparametrization of Piecewise Rational Bézier Curves. 261-264
Session 12
- Asish Mukhopadhyay, Eugene Greene:
On a Geometric Approach to the Segment Sum Problem and Its Generalization. 265-268 - Amr Elmasry, Kazuhisa Makino:
Finding Intersections of Bichromatic Segments Defined by Points. 269-272 - Arindam Karmakar, Sasanka Roy, Sandip Das:
Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. 273-276
Open Problems Session
- Erik D. Demaine, Joseph O'Rourke:
Open Problems from CCCG 2006. CCCG 2007: 277-280
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
