Sign in
Comput. Geom.
1991
2002
2013
2024
1991
2024
Keyphrases
Publications
volume 118, 2024
Sushovan Majhi
,
Carola Wenk
Distance measures for geometric graphs.
Comput. Geom.
118 (2024)
Goran Malic
,
Ileana Streinu
Enumerating combinatorial resultant trees.
Comput. Geom.
118 (2024)
David Glickenstein
Geometric triangulations and discrete Laplacians on manifolds: An update.
Comput. Geom.
118 (2024)
volume 117, 2024
Emily Fox
,
Hongyao Huang
,
Benjamin Raichel
Clustering with faulty centers.
Comput. Geom.
117 (2024)
Pankaj K. Agarwal
,
Matthew J. Katz
,
Micha Sharir
On reverse shortest paths in geometric proximity graphs.
Comput. Geom.
117 (2024)
Abolfazl Poureidi
,
Mohammad Farshi
On algorithmic complexity of imprecise spanners.
Comput. Geom.
117 (2024)
Christian Rieck
,
Christian Scheffer
The dispersive art gallery problem.
Comput. Geom.
117 (2024)
volume 116, 2024
Justin M. Curry
,
Jordan DeSha
,
Adélie Garin
,
Kathryn Hess
,
Lida Kanari
,
Brendan Mallery
From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem.
Comput. Geom.
116 (2024)
Manuel Radons
Edge-unfolding nested prismatoids.
Comput. Geom.
116 (2024)
Meng He
,
Don Sheehy
Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG).
Comput. Geom.
116 (2024)
Sushovan Majhi
,
Jeffrey Vitter
,
Carola Wenk
Approximating Gromov-Hausdorff distance in Euclidean space.
Comput. Geom.
116 (2024)
Franz J. Brandenburg
Straight-line drawings of 1-planar graphs.
Comput. Geom.
116 (2024)
volume 115, 2023
Rivka Gitik
,
Leo Joskowicz
Half-plane point retrieval queries with independent and dependent geometric uncertainties.
Comput. Geom.
115 (2023)
Shangqi Lu
,
Yufei Tao
Range updates and range sum queries on multidimensional points with monoid weights.
Comput. Geom.
115 (2023)
Thomas Fernique
,
Daria Pchelina
Density of triangulated ternary disc packings.
Comput. Geom.
115 (2023)
Jean Cardinal
,
Kolja Knauer
,
Piotr Micek
,
Dömötör Pálvölgyi
,
Torsten Ueckerdt
,
Narmada Varadarajan
Colouring bottomless rectangles and arborescences.
Comput. Geom.
115 (2023)
volume 114, 2023
Ahmad Biniaz
,
Prosenjit Bose
,
Yunkai Wang
Simple linear time algorithms for piercing pairwise intersecting disks.
Comput. Geom.
114 (2023)
Joseph O'Rourke
,
Costin Vîlcu
Cut locus realizations on convex polyhedra.
Comput. Geom.
114 (2023)
Joachim Gudmundsson
,
Yuan Sha
Algorithms for radius-optimally augmenting trees in a metric space.
Comput. Geom.
114 (2023)
Pankaj K. Agarwal
,
Tzvika Geft
,
Dan Halperin
,
Erin Taylor
Multi-robot motion planning for unit discs with revolving areas.
Comput. Geom.
114 (2023)
Martin Balko
,
Adam Sheffer
,
Ruiwen Tang
The constant of point-line incidence constructions.
Comput. Geom.
114 (2023)
volume 113, 2023
Joachim Gudmundsson
,
Yuan Sha
Augmenting graphs to minimize the radius.
Comput. Geom.
113 (2023)
Kevin Buchin
Editorial.
Comput. Geom.
113 (2023)
Edith Elkind
,
Erel Segal-Halevi
,
Warut Suksompong
Keep your distance: Land division with separation.
Comput. Geom.
113 (2023)
Erik D. Demaine
,
Martin L. Demaine
,
Yevhenii Diomidov
,
Tonan Kamata
,
Ryuhei Uehara
,
Hanyu Alice Zhang
(1) refoldings.
Comput. Geom.
113 (2023)
Minati De
,
Abhiruk Lahiri
Geometric dominating-set and set-cover via local-search.
Comput. Geom.
113 (2023)
volume 112, 2023
Rocío González-Díaz
,
M. Soriano-Trigueros
,
Alvaro Torras-Casas
Partial matchings induced by morphisms between persistence modules.
Comput. Geom.
112 (2023)
Annika Bonerath
,
Jan-Henrik Haunert
,
Joseph S. B. Mitchell
,
Benjamin Niedermann
Shortcut hulls: Vertex-restricted outer simplifications of polygons.
Comput. Geom.
112 (2023)
Kyungjin Cho
,
Eunjin Oh
-means clustering of axis-parallel affine subspaces.
Comput. Geom.
112 (2023)
Aritra Banik
,
Rajiv Raman
,
Saurabh Ray
On the geometric priority set cover problem.
Comput. Geom.
112 (2023)
Matthew J. Katz
,
Micha Sharir
Bottleneck matching in the plane.
Comput. Geom.
112 (2023)
David Eppstein
,
Daniel Frishberg
,
Martha C. Osegueda
Angles of arc-polygons and Lombardi drawings of cacti.
Comput. Geom.
112 (2023)
volume 111, 2023
Markus Baumeister
,
Leif Kobbelt
How close is a quad mesh to a polycube?
Comput. Geom.
111 (2023)
Sujoy Bhore
,
Guangping Li
,
Martin Nöllenburg
,
Ignaz Rutter
,
Hsiang-Yun Wu
Untangling circular drawings: Algorithms and complexity.
Comput. Geom.
111 (2023)
Emilio Di Giacomo
,
Fabrizio Montecchiani
Editorial.
Comput. Geom.
111 (2023)
Sarita de Berg
,
Frank Staals
-nearest neighbor queries.
Comput. Geom.
111 (2023)
Katharina Klost
An algorithmic framework for the single source shortest path problem with applications to disk graphs.
Comput. Geom.
111 (2023)
Arun Kumar Das
,
Sandip Das
,
Guilherme Dias da Fonseca
,
Yan Gerard
,
Bastien Rivier
Complexity results on untangling red-blue matchings.
Comput. Geom.
111 (2023)
Peyman Afshani
,
Rasmus Killmann
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions.
Comput. Geom.
111 (2023)
Evgeniy Vodolazskiy
Discrete Fréchet distance for closed curves.
Comput. Geom.
111 (2023)
Satyan L. Devadoss
,
Matthew S. Harvey
Unfoldings and nets of regular polytopes.
Comput. Geom.
111 (2023)
volume 110, 2023
Martin Held
,
Martin Nöllenburg
,
Peter Sanders
Editorial.
Comput. Geom.
110 (2023)
Hwi Kim
,
Jaegun Lee
,
Hee-Kap Ahn
Rectangular partitions of a rectilinear polygon.
Comput. Geom.
110 (2023)
Daniel Bertschinger
,
Meghana M. Reddy
,
Enrico Mann
Lions and contamination: Monotone clearings.
Comput. Geom.
110 (2023)
Ali Mohammad Lavasani
,
Denis Pankratov
Advice complexity of online non-crossing matching.
Comput. Geom.
110 (2023)
Byeonguk Kang
,
Jongmin Choi
,
Hee-Kap Ahn
Intersecting disks using two congruent disks.
Comput. Geom.
110 (2023)
Boris Aronov
,
Esther Ezra
,
Micha Sharir
,
Guy Zigdon
Time and space efficient collinearity indexing.
Comput. Geom.
110 (2023)
William S. Evans
,
Lucca Morais de Arruda Siaudzionis
On path-greedy geometric spanners.
Comput. Geom.
110 (2023)
Meng He
,
Anna Lubiw
,
Mohammad R. Salavatipour
Preface.
Comput. Geom.
110 (2023)
Erik D. Demaine
,
Maarten Löffler
,
Christiane Schmidt
Rectangular Spiral Galaxies are still hard.
Comput. Geom.
110 (2023)