default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computational Geometry, Volume 6
Volume 6, Number 1, 2015
- Michael A. Bekos, Chrysanthi N. Raftopoulou:
On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs. 1-20 - Menelaos I. Karavelas, Christos Konaxis, Eleni Tzanaki:
The maximum number of faces of the Minkowski sum of three convex polytopes. 21-74 - Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann
, Frank Staals:
Trajectory grouping structure. 75-98 - Pedro Martín, Horst Martini:
Algorithms for ball hulls and ball intersections in normed planes. 99-107 - William S. Evans, Noushin Saeedi:
On characterizing terrain visibility graphs. 108-141 - Luc Devroye, James King:
Random hyperplane search trees in high dimensions. 142-164 - Magnus Lie Hetland:
Ptolemaic indexing. 165-184 - Andrei Asinowski, Tillmann Miltzow, Günter Rote:
Quasi-parallel segments and characterization of unique bichromatic matchings. 185-219 - Santanu Bhowmick, Kasturi R. Varadarajan, Shi-Ke Xue:
A constant-factor approximation for multi-covering with disks. 220-234 - Ronald Ortner:
Forcing subarrangements in complete arrangements of pseudocircles. 235-248 - Christian Scheffer, Jan Vahrenhold:
Subquadratic medial-axis approximation in $\mathbb{R}^3$. 249-287 - John C. Baez, Karine Bagdasaryan, Philip Gibbs:
The Lebesgue universal covering problem. 288-299 - Balázs Keszegh, Dömötör Pálvölgyi:
More on decomposing coverings by octants. 300-315 - Danny Z. Chen, Haitao Wang:
A new algorithm for computing visibility graphs of polygonal obstacles in the plane. 316-345
Volume 6, Number 2, 2015
- Siu-Wing Cheng, Olivier Devillers:
Guest Editors' Foreword. 1 - Tal Kaminker, Micha Sharir:
Finding the largest disk containing a query point in logarithmic time with linear storage. 3-18 - Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. 19-53 - Anna Gundert, May Szedlák:
Higher dimensional discrete Cheeger inequalities. 54-71 - Sander P. A. Alewijnse, Timur M. Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg:
Progressive geometric algorithms. 72-92 - Bernd Gärtner:
Sampling with removal in LP-type problems. 93-112 - Shay Solomon:
Euclidean Steiner shallow-light trees. 113-139 - Frédéric Chazal, Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo, Larry A. Wasserman:
Stochastic convergence of persistence landscapes and silhouettes. 140-161 - Ulrich Bauer, Michael Lesnick:
Induced matchings and the algebraic stability of persistence barcodes. 162-191
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 2026-04-30 00:43 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:
