Conferences in DBLP
Anna Lubiw Morphing Planar Graph Drawings. [Citation Graph (0, 0)][DBLP ] Conf ] Géza Tóth Note on the Pair-Crossing Number and the Odd-Crossing Number. [Citation Graph (0, 0)][DBLP ] Conf ] Otfried Cheong The Harmony of Spheres. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Joseph S. B. Mitchell , Jack Snoeyink Capturing Crossings: Convex Hulls of Segment and Plane Intersections. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia 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. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Bitner , Ovidiu Daescu Finding Segments and Triangles Spanned by Points in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] Val Pinciu On the Fewest Nets Problem for Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Langberg , Leonard J. Schulman Contraction and Expansion of Convex Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Ackerman , Oswin Aichholzer , Balázs Keszegh Improved Upper Bounds on the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Binay K. Bhattacharya , Sandip Das , Daya Ram Gaur , Qiaosheng Shi Computing a planar widest empty alpha-siphon in o(n3 ) time. [Citation Graph (0, 0)][DBLP ] Conf ] Marc J. van Kreveld , Bettina Speckmann On the Number of Empty Pseudo-Triangles in Point Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Näher , Martin Taphorn Experimental Evaluation of Structural Filtering as a Tool for Exact and Efficient Geometric Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Mörig , Stefan Schirra On the Design and Performance of Reliable Geometric Predicates using Error-free Transformations and Exact Sign of Sum Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Prosenjit Bose , Jason Morrison Optimal Point Set Partitioning using Rigid Motion Star Placement. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Yefim Dinitz Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Lenchner An Improved Bound for the Affine Sylvester Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Asish Mukhopadhyay , Eugene Greene The Ordinary Line Problem Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] David Letscher Reconstructing Submanifolds of Euclidean Space. [Citation Graph (0, 0)][DBLP ] Conf ] Sheung-Hung Poon On Unfolding Trees and Polygons on Various Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Marcus Schaefer , Eric Sedgwick , Daniel Stefankovic Spiralling and Folding: The Topological View. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Benton , Joseph O'Rourke Unfolding Polyhedra via Cut-Tree Truncation. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Bitner , Ovidiu Daescu Minimum-sum Dipolar Spanning Tree for Points in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] Kamrul Islam , Henk Meijer , Yurai Núñez Rodríguez , David Rappaport , Henry Xiao Hamilton Circuits in Hexagonal Grid Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl Realizations of Hexagonal Graph Representations. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew J. Katz , Nissan Lev-Tov , Gila Morgenstern Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Balázs Keszegh Weak Conflict-Free Colorings of Point Sets and Simple Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Brass , Ferran Hurtado , Benjamin J. Lafreniere , Anna Lubiw A Lower Bound on the Area of a 3-Coloured Disc Packing. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Giesen , Balint Miklos , Mark Pauly Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Brooks , Liam Watson Simplification of Scalar Data via Monotone-Light Factorizations. [Citation Graph (0, 0)][DBLP ] Conf ] Audrey Lee , Ileana Streinu , Louis Theran The Slider-Pinning Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sören Laue , Domagoj Matijevic Approximating k-hop Minimum Spanning Trees in Euclidean Metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Zhiyong Lin Terminal Steiner Tree with Bounded Edge Length. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Liad Serruya , Ariel Shamir Image Compression Terrain Simplification. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Matthew J. Katz , Igor Zaslavsky Distance Preserving Terrain Simplification - An Experimental Study. [Citation Graph (0, 0)][DBLP ] Conf ] Suddha Basu , Jack Snoeyink Terrain Representation using Right-Triangulated Irregular Networks. [Citation Graph (0, 0)][DBLP ] Conf ] 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. [Citation Graph (0, 0)][DBLP ] Conf ] 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. [Citation Graph (0, 0)][DBLP ] Conf ] Binay K. Bhattacharya , Jeff Sember Efficient Snap Rounding with Integer Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Eli Packer Extending the Power of Snap Rounding Variants. [Citation Graph (0, 0)][DBLP ] Conf ] Peyman Afshani , Arash Farzan Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Gereon Frahling , Christian Sohler Efficient Kinetic Data Structures for MaxCut. [Citation Graph (0, 0)][DBLP ] Conf ] Rodrigo I. Silveira , Marc J. van Kreveld Towards a Definition of Higher Order Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] David Letscher Vector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations. [Citation Graph (0, 0)][DBLP ] Conf ] Priya Ranjan Sinha Mahapatra , Partha P. Goswami , Sandip Das Covering Points by Isothetic Unit Squares. [Citation Graph (0, 0)][DBLP ] Conf ] Trung Nguyen , Jean-Daniel Boissonnat , Frédéric Falzon , Christian Knauer A Disk-Covering Problem with Application in Optical Interferometry. [Citation Graph (0, 0)][DBLP ] Conf ] Zouhour Ben Azouz , Prosenjit Bose , Chang Shu , Stefanie Wuhrer Approximations of Geodesic Distances for Incomplete Triangular Manifolds. [Citation Graph (0, 0)][DBLP ] Conf ] Dror Aiger , Klara Kedem Exact and Approximate Geometric Pattern Matching for Point Sets in the Plane under Similarity Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Prosenjit Bose , Paz Carmi , Anil Maheshwari , Chang Shu , Michiel H. M. Smid , Stefanie Wuhrer Linear-Space Algorithms for Distance Preserving Embedding. [Citation Graph (0, 0)][DBLP ] Conf ] Sasanka Roy , Sachin Lodha , Sandip Das , Anil Maheshwari Approximate Shortest Descent Path on a Terrain. [Citation Graph (0, 0)][DBLP ] Conf ] Ethan Kim , Sue Whitesides , Giuseppe Liotta A Note on Drawing Direction-constrained Paths in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Yury Kholondyrev , William Evans Optimistic and Pessimistic Shortest Paths on Uncertain Terrains. [Citation Graph (0, 0)][DBLP ] Conf ] Cem Boyaci , Hale Erten , Alper Üngör Triangulations Loosing Bundles and Weight. [Citation Graph (0, 0)][DBLP ] Conf ] Hale Erten , Alper Üngör Computing Acute and Non-obtuse Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Franz Aurenhammer , Thomas Hackl , Bettina Speckmann On (Pointed) Minimum Weight Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Marc J. van Kreveld , Maarten Löffler , Rodrigo I. Silveira Largest Subsets of Triangles in a Triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Masaki Moriguchi , Kokichi Sugihara Restricted Edge Contractions in Triangulations of the Sphere with Boundary. [Citation Graph (0, 0)][DBLP ] Conf ] Shabnam Aziza , Therese C. Biedl Improved Layouts of the Multigrid Network. [Citation Graph (0, 0)][DBLP ] Conf ] Fabrizio Frati Straight-line Drawings of Outerplanar Graphs in O(dn log n) Area. [Citation Graph (0, 0)][DBLP ] Conf ] Anil 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 On Bus Graph Realizability. [Citation Graph (0, 0)][DBLP ] Conf ] 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. [Citation Graph (0, 0)][DBLP ] Conf ] Oswin Aichholzer , Günter Rote , André Schulz , Birgit Vogtenhuber Pointed Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Pengpeng Wang , Ramesh Krishnamurti , Kamal Gupta Generalized Watchman Route Problem with Discrete View Cost. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Bahun , Anna Lubiw Optimal Schedules for 2-guard Room Search. [Citation Graph (0, 0)][DBLP ] Conf ] AmirAli Khosravi , Alireza Zarei , Mohammad Ghodsi Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Conf ] Arturo Gonzalez-Gutierrez , Teofilo F. Gonzalez Approximation Algorithms for the Minimum-Length Corridor and Related Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Kraemer , David Cazier , Dominique Bechmann A General and Efficient Representation for Multiresolution Meshes: Application to Quad/Triangle Subdivision. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Rolinsky , François Dupret Practical C1 Reparametrization of Piecewise Rational Bézier Curves. [Citation Graph (0, 0)][DBLP ] Conf ] Asish Mukhopadhyay , Eugene Greene On a Geometric Approach to the Segment Sum Problem and Its Generalization. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry , Kazuhisa Makino Finding Intersections of Bichromatic Segments Defined by Points. [Citation Graph (0, 0)][DBLP ] Conf ] Arindam Karmakar , Sasanka Roy , Sandip Das Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Joseph O'Rourke Open Problems from CCCG 2006. [Citation Graph (0, 0)][DBLP ] Conf ] 