default search action
Computational Geometry: Theory and Applications, Volume 46
Volume 46, Number 1, January 2013
- Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A sufficient condition for the existence of plane spanning trees on geometric graphs. 1-6 - Zoran Sunic
:
Normal art galleries: Wall in - all in. 7-16 - Oswin Aichholzer
Maximizing maximal angles for plane straight-line graphs. 17-28 - Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta
On point-sets that support planar graphs. 29-50 - Victor Chepoi, Daniela Maftuleac:
Shortest path problem in rectangular complexes of global nonpositive curvature. 51-64 - Sergey Bereg, José Miguel Díaz-Báñez
On the coarseness of bicolored point sets. 65-77 - Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman
Non-crossing matchings of points with geometric objects. 78-92 - Marc Arnaudon, Frank Nielsen
On approximating the Riemannian 1-center. 93-104 - Rubén Dorado
Advancing front circle packing to approximate conformal strips. 105-118
Volume 46, Number 2, February 2013
- Stephane Durocher, Jason Morrison
Foreword. 119 - Prosenjit Bose
Stable Roommates Spanner. 120-130 - Prosenjit Bose
Some properties of k-Delaunay and k-Gabriel graphs. 131-139 - Dan Chen, Olivier Devillers
Oja centers and centers of gravity. 140-147 - Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. 148-153 - Oswin Aichholzer
Blocking Delaunay triangulations. 154-159 - Leonidas J. Guibas, Nikola Milosavljevic, Arik Motskin:
Connected dominating sets on dynamic geometric graphs. 160-172 - Imre Bárány, William L. Steiger:
On the variance of random polygons. 173-180 - Prosenjit Bose
Fast local searches and updates in bounded universes. 181-189
Volume 46, Number 3, April 2013
- Adrian Dumitrescu, Minghui Jiang:
On reconfiguration of disks in the plane and related problems. 191-202 - Sergio Cabello
Covering a bichromatic point set with two disjoint monochromatic disks. 203-212 - Eyal Ackerman, Tsachik Gelander
Ice-creams and wedge graphs. 213-218 - James King:
Fast vertex guarding for polygons with and without holes. 219-231 - Jesús A. De Loera, Brandon E. Dutra, Matthias Köppe
Software for exact integration of polynomials over polyhedra. 232-252 - Hee-Kap Ahn
Covering and piercing disks with two centers. 253-262 - Georg Maier, Georg Pisinger:
Approximation of a closed polygon with a minimum number of circular arcs and line segments. 263-275 - Therese Biedl, Lesvia Elena Ruiz Velázquez:
Drawing planar 3-trees with given face areas. 276-285 - Jan Brandts, Sander Dijkhuis, Vincent de Haan, Michal Krízek:
There are only two nonobtuse binary triangulations of the unit n-cube. 286-297 - Boris Aronov
How to cover a point set with a V-shape of minimum width. 298-309 - Minati De
An in-place min-max priority search tree. 310-327 - Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing strong connectivity using optimal radius half-disk antennas. 328-339 - John Augustine, Sandip Das, Anil Maheshwari, Subhas C. Nandy, Sasanka Roy, Swami Sarvattomananda:
Localized geometric query problems. 340-357 - Pankaj K. Agarwal, Lars Arge, Sathish Govindarajan, Jun Yang, Ke Yi:
Efficient external memory structures for range-aggregate queries. 358-370 - Mostafa Nouri Baygi
Space/query-time tradeoff for computing the visibility polygon. 371-381 - David Avis, Hiroyuki Miyata, Sonoko Moriyama
Families of polytopal digraphs that do not satisfy the shelling property. 382-393 - Reuven Bar-Yehuda, Dror Rawitz:
A note on multicovering with disks. 394-399
Volume 46, Number 4, May 2013
- Ferran Hurtado, Marc J. van Kreveld:
Guest Editors' foreword. 401 - John Hershberger:
Stable snap rounding. 403-416 - Esther Ezra, Wolfgang Mulzer
Convex hull of points lying on lines in time after preprocessing. 417-434 - Chao Chen, Michael Kerber:
An output-sensitive algorithm for persistent homology. 435-447 - Dominique Attali, André Lieutier, David Salinas:
Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes. 448-465 - Vít Jelínek
A Kuratowski-type theorem for planarity of partially embedded graphs. 466-492
Volume 46, Number 5, July 2013
- David Bremner, Antoine Deza, Hiroshi Imai, Sonoko Moriyama
Editorial. 493 - Selin Damla Ahipasaoglu
A modified Frank-Wolfe algorithm for computing minimum-area enclosing ellipsoidal cylinders: Theory and algorithms. 494-519 - Jon W. Van Laarhoven, Kurt M. Anstreicher:
Geometric conditions for Euclidean Steiner trees in ℜd. 520-531 - Jürgen Bokowski, Lars Schewe
On the finite set of missing geometric configurations (n4). 532-540 - Sven Herrmann, Michael Joswig
Computing the bounded subcomplex of an unbounded polyhedron. 541-551 - Hee-Kap Ahn
Maximum overlap of convex polytopes under translation. 552-565 - Dan Chen, Pat Morin
Absolute approximation of Tukey depth: Theory and experiments. 566-573 - André Schulz, Csaba D. Tóth:
The union of colorful simplices spanned by a colored point set. 574-590
Volume 46, Number 6, August 2013
- Siu-Wing Cheng
Shape matching under rigid motion. 591-603 - William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta
Approximate proximity drawings. 604-614 - Menelaos I. Karavelas, Raimund Seidel, Eleni Tzanaki:
Convex hulls of spheres and convex hulls of disjoint convex polytopes. 615-630 - Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid:
On the power of the semi-separated pair decomposition. 631-639 - Omkar Kulkarni, Huaming Zhang:
An optimal greedy routing algorithm for triangulated polygons. 640-647 - Hyo-Sil Kim, Otfried Cheong
The cost of bounded curvature. 648-672 - Xiaodong Wu, Xin Dou, John E. Bayouth, John M. Buatti
An almost linear time algorithm for field splitting in radiation therapy. 673-687 - Moria Ben-Ner, André Schulz, Adam Sheffer:
On numbers of pseudo-triangulations. 688-699 - Evan VanderZee, Anil N. Hirani, Damrong Guoy, Vadim Zharnitsky, Edgar A. Ramos:
Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions. 700-724 - József Balogh, Hernán González-Aguilar, Gelasio Salazar:
Large convex holes in random point sets. 725-733 - Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir:
The 2-center problem in three dimensions. 734-746 - Mark de Berg, Atlas F. Cook IV, Joachim Gudmundsson
Fast Fréchet queries. 747-755 - Umut A. Acar, Andrew Cotter, Benoît Hudson, Duru Türkoglu:
Dynamic well-spaced point sets. 756-773 - Michael Kaufmann, Tamara Mchedlidze
On upward point set embeddability. 774-804 - Andrew Adamatzky:
On growing connected β-skeletons. 805-816
Volume 46, Number 7, October 2013
- Sébastien Collette, Stefan Langerman
Editorial. 817 - Prosenjit Bose
On plane geometric spanners: A survey and open problems. 818-830 - Christian Wulff-Nilsen:
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time. 831-838 - Panos Giannopoulos, Christian Knauer, Günter Rote, Daniel Werner:
Fixed-parameter tractability and lower bounds for stabbing problems. 839-860 - Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg:
On inducing polygons and related problems. 861-878 - Andreas Razen, Emo Welzl:
On the number of crossing-free partitions. 879-893 - Boris Aronov
Witness Gabriel graphs. 894-908
Volume 46, Number 8, October 2013
- Emilio Di Giacomo
Area requirement of graph drawings with few crossings per edge. 909-916 - Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono
Efficient reconfiguration of lattice-based modular robots. 917-928 - Emilio Di Giacomo
Orthogeodesic point-set embedding of trees. 929-944 - Javier Cano, Csaba D. Tóth, Jorge Urrutia:
A tight bound for point guards in piecewise convex art galleries. 945-958 - Tetsuo Asano, Kevin Buchin
Memory-constrained algorithms for simple polygons. 959-969 - Oswin Aichholzer
Extreme point and halving edge search in abstract order types. 970-978 - Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, Joseph O'Rourke:
Refold rigidity of convex polyhedra. 979-989 - Martin Balko
Grid representations and the chromatic number. 990-1002 - Tamara Mchedlidze
Upward planar embedding of an n-vertex oriented path on O(n2) points. 1003-1008 - Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote:
Optimally solving a transportation problem using Voronoi diagrams. 1009-1016
Volume 46, Number 9, November 2013
- Rom Aschner, Matthew J. Katz, Gila Morgenstern:
Symmetric connectivity with directional antennas. 1017-1026 - Jean Cardinal, Matias Korman:
Coloring planar homothets and three-dimensional hypergraphs. 1027-1035 - Victor Chepoi, Stefan Felsner:
Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. 1036-1041 - Hee-Kap Ahn
Realistic roofs over a rectilinear polygon. 1042-1055 - Dániel Gerbner
Separating families of convex sets. 1056-1058 - Dan Chen, Pat Morin
Approximating majority depth. 1059-1064
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-20 21:00 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: