default search action
Computational Geometry: Theory and Applications, Volume 48
Volume 48, Number 1, January 2015
- Jens M. Schmidt
, Pavel Valtr:
Cubic plane graphs on a given point set. 1-13 - José Miguel Díaz-Báñez
New results on stabbing segments with a polygon. 14-29
Volume 48, Number 2, February 2015
- Danny Z. Chen, Haitao Wang:
Visibility and ray shooting queries in polygonal domains. 31-41 - Patrizio Angelini
Relaxing the constraints of clustered planarity. 42-75 - Stefan Funke, Theocharis Malamatos, Domagoj Matijevic, Nicola Wolpert:
Conic nearest neighbor queries and approximate Voronoi diagrams. 76-86 - Sándor Bozóki
Seven mutually touching infinite cylinders. 87-93 - Esther M. Arkin, José Miguel Díaz-Báñez
Bichromatic 2-center of pairs of points. 94-107 - Prosenjit Bose
The θ5-graph is a spanner. 108-119 - Therese Biedl, Martin Held, Stefan Huber
Weighted straight skeletons in the plane. 120-133 - Esther M. Arkin, Antonio Fernández Anta
Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions. 134-146
Volume 48, Number 3, March 2015
- Sorelle A. Friedler, David M. Mount
A sensor-based framework for kinetic data compression. 147-168 - Sergey Bereg
On balanced 4-holes in bichromatic point sets. 169-179 - Tijana Sukilovic
Curvature based shape detection. 180-188 - Marko Savic
Linear time algorithm for optimal feed-link placement. 189-204 - Kyle Klein, Subhash Suri:
Capture bounds for visibility-based pursuit evasion. 205-220 - Imre Bárány, Ferenc Fodor
A fractional Helly theorem for boxes. 221-224 - Rade T. Zivaljevic:
Illumination complexes, Δ-zonotopes, and the polyhedral curtain theorem. 225-236 - Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Ljubomir Perkovic:
Tight stretch factors for L1- and L∞-Delaunay triangulations. 237-250 - Paz Carmi, Eran Friedman, Matthew J. Katz:
Spiderman graph: Visibility in urban regions. 251-259 - Noga Alon, Ohad N. Feldheim
Drawing outerplanar graphs using three edge lengths. 260-267 - Adrian Rusu, Andrew J. Fabian:
A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio. 268-294
Volume 48, Number 4, May 2015
- Jan Kyncl
Saturated simple and k-simple topological graphs. 295-310 - Harsh Bhatia, Bei Wang, Gregory Norgard, Valerio Pascucci
Local, smooth, and consistent Jacobi set simplification. 311-332 - Orit E. Raz:
On the zone of the boundary of a convex body. 333-341 - Zahed Rahmati
A simple, faster method for kinetic proximity problems. 342-359 - Sergio Cabello
Shortest paths in intersection graphs of unit disks. 360-367
Volume 48, Number 5, July 2015
- Alejandro López-Ortiz:
Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG). 369 - Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza
Solving the natural wireless localization problem to optimality efficiently. 370-379 - Timothy M. Chan, Nan Hu:
Geometric red-blue set cover for unit squares and related problems. 380-385 - Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting triangulations and other crossing-free structures approximately. 386-397 - Fatemeh Panahi, A. Frank van der Stappen
Reprint of: Bounding the locus of the center of mass for a part with shape variation. 398-406 - Oswin Aichholzer, Sang Won Bae
Reprint of: Theta-3 is connected. 407-414 - Giovanni Viglietta:
Reprint of: Face-guarding polyhedra. 415-428 - Therese Biedl, Martin Held, Stefan Huber
Reprint of: Weighted straight skeletons in the plane. 429-442
Volume 48, Number 6, August 2015
- Danny Ziyi Chen, Haitao Wang:
Weak visibility queries of line segments in simple polygons. 443-452 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
On full Steiner trees in unit disk graphs. 453-458 - Thomas Bläsius, Ignaz Rutter
Disconnectivity and relative positions in simultaneous embeddings. 459-478 - Joachim Gudmundsson
Fast algorithms for approximate Fréchet matching queries in geometric trees. 479-494 - Sang Won Bae
Computing the L1 geodesic diameter and center of a simple polygon in linear time. 495-505
Volume 48, Number 7, August 2015
- Thanh-Tung Cao, Herbert Edelsbrunner, Tiow Seng Tan:
Triangulations from topologically correct digital Voronoi diagrams. 507-519 - Filip Moric, János Pach:
Remarks on Schur's conjecture. 520-527 - Oswin Aichholzer, Ruy Fabila Monroy, Hernán González-Aguilar, Thomas Hackl, Marco A. Heredia
On k-gons and k-holes in point sets. 528-537
Volume 48, Number 8, September 2015
- Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu
On the complexity of higher order abstract Voronoi diagrams. 539-551
- Timothy M. Chan, Rolf Klein:
Guest Editor's foreword. 552-553 - Jonathan Richard Shewchuk, Brielin C. Brown:
Fast segment insertion and incremental construction of constrained Delaunay triangulations. 554-574 - Tamal K. Dey, Fengtao Fan, Yusu Wang:
Graph induced complex on point data. 575-588 - Cong Wang, Yi-Jen Chiang, Chee-Keng Yap:
On soft predicates in subdivision motion planning. 589-605 - Dominique Attali, Ulrich Bauer
Homological reconstruction and simplification in R3. 606-621 - Greg Aloupis, Luis Barba, Stefan Langerman
Bichromatic compatible matchings. 622-633
Volume 48, Number 9, October 2015
- Sang-Sub Kim, Hee-Kap Ahn
An improved data stream algorithm for clustering. 635-645 - Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid:
Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties. 646-660 - Kiyoshi Hosono:
On the minimum number of mutually disjoint holes in planar point sets. 661-672 - Farnaz Sheikhi
Separating bichromatic point sets by L-shapes. 673-687 - Gokarna Sharma, Costas Busch, Ramachandran Vaidyanathan, Suresh Rai, Jerry L. Trahan
Efficient transformations for Klee's measure problem in the streaming model. 688-702 - Adrian Dumitrescu, Minghui Jiang:
On the approximability of covering points by lines and related problems. 703-717 - A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi, Anil Maheshwari, Michiel H. M. Smid:
Approximating the bottleneck plane perfect matching of a point set. 718-731 - Peter Brass
Shortest path planning for a tethered robot. 732-742
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-12-26 00:35 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: