default search action
Computational Geometry, Volume 42
Volume 42, Number 1, January 2009
- Hoa Nguyen, John V. Burkardt, Max D. Gunzburger, Lili Ju
, Yuki Saka:
Constrained CVT meshes and a comparison of triangular mesh generators. 1-19 - Shripad Thite:
Adaptive spacetime meshing for discontinuous Galerkin methods. 20-44 - Lilian Buzer:
Optimal simplification of polygonal chains for subpixel-accurate rendering. 45-59 - Prosenjit Bose
Flips in planar graphs. 60-80 - Vojtech Franek, Jirí Matousek:
Computing D-convex hulls in the plane. 81-89 - Ana Paulina Figueroa
A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs. 90-91
Volume 42, Number 2, February 2009
- Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff
Matching points with rectangles and squares. 93-108 - Alper Üngör:
Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations. 109-118 - Peter Brass
Escaping offline searchers and isoperimetric theorems. 119-126 - János Pach, Géza Tóth:
Decomposition of multiple coverings into many parts. 127-133 - Prosenjit Bose
Geometric spanners with small chromatic number. 134-146 - Konstantin A. Rybnikov:
An efficient local approach to convexity testing of piecewise-linear hypersurfaces. 147-172 - Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
Simultaneous graph embedding with bends and circular arcs. 173-182
Volume 42, Number 3, April 2009
- Jean Cardinal, Sébastien Collette, Stefan Langerman
Empty region graphs. 183-195 - Ho-Lun Cheng, Xinwei Shi:
Quality mesh generation for molecular skin surfaces using restricted union of balls. 196-206 - Hee-Kap Ahn
On the minimum total length of interval systems expressing all intervals, and range-restricted queries. 207-213 - Md. Saidur Rahman
Octagonal drawings of plane graphs with prescribed face areas. 214-230 - Joachim Gudmundsson
Region-restricted clustering for geographic data mining. 231-240 - Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
Improved upper bounds on the reflexivity of point sets. 241-249 - Mark de Berg, Herman J. Haverkort, Micha Streppel:
Efficient c-oriented range searching with DOP-trees. 250-267
Volume 42, Number 4, May 2009
- Jens Egeblad, Benny K. Nielsen, Marcus Brazil
Translational packing of arbitrary polytopes. 269-288 - Tetsuo Asano, Prosenjit Bose
A linear-space algorithm for distance preserving graph embedding. 289-304 - Sergey Bereg:
Orthogonal equipartitions. 305-314 - Horst Martini, Senlin Wu:
Geometric dilation of closed curves in normed planes. 315-321 - Rodrigo I. Silveira
Towards a definition of higher order constrained Delaunay triangulations. 322-337 - Pedro A. Ramos
Depth of segments and circles through points enclosing many points: a note. 338-341 - Yakov Nekrich
Orthogonal range searching in linear and almost-linear space. 342-351 - Ihsan Salleh:
K-vertex guarding simple polygons. 352-361
Volume 42, Number 5, July 2009
- Prosenjit Bose
Editorial CCCG 2005. 363 - Stephane Durocher, David G. Kirkpatrick:
The projection median of a set of points. 364-375 - David P. Wagner, Robert L. Scot Drysdale, Clifford Stein:
An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. 376-387 - Diane L. Souvaine, Csaba D. Tóth:
A vertex-face assignment for plane graphs. 388-394 - Therese Biedl, Anna Lubiw, Michael J. Spriggs:
Morphing polyhedra with parallel faces: Counterexamples. 395-402 - Robert Benkoczi, Binay K. Bhattacharya, Sandip Das, Jeff Sember:
Single facility collection depots location problem in the plane. 403-418 - Timothy G. Abbott, Michael A. Burr
Dynamic ham-sandwich cuts in the plane. 419-428 - Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
The distance geometry of music. 429-454 - Boris Aronov
Small weak epsilon-nets. 455-462
- Henk Meijer, David Rappaport:
Editorial CCCG 2006. 463 - Mustaq Ahmed, Anna Lubiw:
Shortest descending paths through given faces. 464-470 - Prosenjit Bose
Rotationally monotone polygons. 471-483 - Hazel Everett, Sylvain Lazard, William J. Lenhart, Linqiao Zhang:
On the degree of standard geometric predicates for line transversals in 3D. 484-494 - Brendan Lucier:
Local overlaps in special unfoldings of convex polyhedra. 495-504
Volume 42, Numbers 6-7, August 2009
- Nabil H. Mustafa
An optimal extension of the centerpoint theorem. 505-510 - Tibor Jordán, Zoltan Szabadka:
Operations preserving the global rigidity of graphs and frameworks in the plane. 511-521 - Menelaos I. Karavelas, Csaba D. Tóth, Elias P. Tsigaridas:
Guarding curvilinear art galleries with vertex or point guards. 522-535 - Pedro Machado Manhães de Castro, Frédéric Cazals
Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere. 536-550 - Frédéric Cazals
Computing the arrangement of circles on a sphere, with applications in structural biology. 551-565 - Frédéric Chazal, David Cohen-Steiner, André Lieutier:
Normal cone approximation and offset shape isotopy. 566-581 - Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao:
Not being (super)thin or solid is hard: A study of grid Hamiltonicity. 582-605 - Harish Doraiswamy, Vijay Natarajan:
Efficient algorithms for computing Reeb graphs. 606-616 - Oswin Aichholzer
Compatible geometric matchings. 617-626 - Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
On minimum weight pseudo-triangulations. 627-631 - Sasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy:
Constrained minimum enclosing circle with center on a query line segment. 632-638 - Gregor Jerse, Neza Mramor-Kosta:
Ascending and descending regions of a discrete Morse function. 639-651 - Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman
Linear reconfiguration of cube-style modular robots. 652-663 - Emilio Di Giacomo
Point-set embeddings of trees with given partial drawings. 664-676 - Costas Panagiotakis
The equipartition of curves. 677-689 - Henk Meijer, Yurai Núñez Rodríguez, David Rappaport:
Bounds for point recolouring in geometric graphs. 690-703 - Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov
Characterization of unlabeled level planar trees. 704-721 - Kurt Mehlhorn, Jörg-Rüdiger Sack, Joseph Zaks:
Note on the paper "K-vertex guarding simple polygons" [Computational Geometry 42 (4) (May 2009) 352-361]. 722
Volume 42, Number 8, October 2009
- Oswin Aichholzer, Franz Aurenhammer:
Editorial. 723 - Kevin Buchin
Transforming spanning trees: A lower bound. 724-730 - Siddhartha Chaudhuri, Vladlen Koltun:
Smoothed analysis of probabilistic roadmaps. 731-747 - Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman
Wrapping spheres with flat paper. 748-757 - Julien Demouth, Olivier Devillers
On the complexity of umbra and penumbra. 758-771 - Darko Dimitrov, Christian Knauer, Klaus Kriegel, Günter Rote:
Bounds on the quality of the PCA bounding boxes. 772-789 - David Eppstein, Marc J. van Kreveld, Elena Mumford, Bettina Speckmann
Edges and switches, tunnels and bridges. 790-802 - Rodrigo I. Silveira
Optimal higher order Delaunay triangulations of polygons. 803-813
Volume 42, Number 9, November 2009
- Sergio Cabello
Algorithms for graphs of bounded treewidth via orthogonal range searching. 815-824 - Joachim Gudmundsson, Jyrki Katajainen, Damian Merrick, Cahya Ong, Thomas Wolle:
Compressing spatio-temporal trajectories. 825-841 - Padmini Mukkamala, Mario Szegedy:
Geometric representation of cubic graphs with four directions. 842-851 - Rajasekhar Inkulu, Sanjiv Kapoor:
Visibility queries in a polygonal region. 852-864 - Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu:
Visibility representations of four-connected plane graphs with near optimal heights. 865-872 - Rajasekhar Inkulu, Sanjiv Kapoor:
Planar rectilinear shortest path computation using corridors. 873-884 - Rolf Klein, Elmar Langetepe, Zahra Nilforoushan:
Abstract Voronoi diagrams revisited. 885-902 - Sang Won Bae
Computing minimum-area rectilinear convex hull and L-shape. 903-912 - Alfredo García Olaverri, Ferran Hurtado, Clemens Huemer
On triconnected and cubic plane graphs on given point sets. 913-922 - Rolf Klein, Christian Knauer, Giri Narasimhan
On the dilation spectrum of paths, cycles, and trees. 923-933 - Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer
Empty monochromatic triangles. 934-938 - Hans L. Bodlaender
On the minimum corridor connection problem and other generalized geometric problems. 939-951
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 2024-11-14 20:49 CET 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: