Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             261 results found
no title author magazine year volume issue page(s) type
1 Acknowledgement of priority — A fractional Helly theorem for boxes Bárány, I.
2018
70-71 C p. 1-
1 p.
article
2 A duality transform for constructing small grid embeddings of 3d polytopes Igamberdiev, Alexander
2016
70-71 C p. 19-36
18 p.
article
3 A fast algorithm for computing irreducible triangulations of closed surfaces in E d Ramaswami, Suneeta
2018
70-71 C p. 327-357
article
4 Affine invariants of generalized polygons and matching under affine transformations Chávez, Edgar
2016
70-71 C p. 60-69
10 p.
article
5 Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs Angelini, Patrizio
2015
70-71 C p. 34-48
15 p.
article
6 A linearized circle packing algorithm Orick, Gerald L.
2017
70-71 C p. 13-29
17 p.
article
7 A lower bound for computing geometric spanners Farshi, Mohammad
2016
70-71 C p. 21-26
6 p.
article
8 A lower bound on opaque sets Kawamura, Akitoshi
2019
70-71 C p. 13-22
article
9 Alternating paths and cycles of minimum length Evans, W.
2016
70-71 C p. 124-135
12 p.
article
10 Altitude terrain guarding and guarding uni-monotone polygons Daescu, Ovidiu
2019
70-71 C p. 22-35
article
11 Amortized analysis of smooth quadtrees in all dimensions Bennett, Huck
2017
70-71 C p. 20-39
20 p.
article
12 An algorithm for the maximum weight independent set problem on outerstring graphs Keil, J. Mark
2017
70-71 C p. 19-25
7 p.
article
13 An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments Bae, Sang Won
2016
70-71 C p. 34-43
10 p.
article
14 Analysis of farthest point sampling for approximating geodesics in a graph Kamousi, Pegah
2016
70-71 C p. 1-7
7 p.
article
15 An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets Bárány, Imre

70-71 C p.
article
16 A new lower bound on the maximum number of plane graphs using production matrices Huemer, Clemens
2019
70-71 C p. 36-49
article
17 An improved algorithm for diameter-optimally augmenting paths in a metric space Wang, Haitao
2018
70-71 C p. 11-21
article
18 An improved construction for spanners of disks Smid, Michiel

70-71 C p.
article
19 An improved upper bound on dilation of regular polygons Sattari, Sattar
2019
70-71 C p. 53-68
article
20 An optimal algorithm for plane matchings in multipartite geometric graphs Biniaz, Ahmad
2017
70-71 C p. 1-9
9 p.
article
21 A note on interference in random networks Devroye, L.
2018
70-71 C p. 2-10
9 p.
article
22 A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares Ito, Takehiro
2016
70-71 C p. 25-39
15 p.
article
23 Approximate range closest-pair queries Xue, Jie

70-71 C p.
article
24 Approximating dominating set on intersection graphs of rectangles and L -frames Bandyapadhyay, Sayan
2019
70-71 C p. 32-44
article
25 Approximating the integral Fréchet distance Maheshwari, Anil
2018
70-71 C p. 13-30
article
26 Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points Chan, Timothy M.
2017
70-71 C p. 2-7
6 p.
article
27 Approximating the rectilinear crossing number Fox, Jacob
2019
70-71 C p. 45-53
article
28 Approximation algorithms for geometric conflict free covering problems Banik, Aritra

70-71 C p.
article
29 Approximation algorithms for Max Morse Matching Rathod, Abhishek
2017
70-71 C p. 1-23
23 p.
article
30 Approximation algorithms for the unit disk cover problem in 2D and 3D Biniaz, Ahmad
2017
70-71 C p. 8-18
11 p.
article
31 A product inequality for extreme distances Dumitrescu, Adrian
2019
70-71 C p.
article
32 A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams Bohler, Cecilia
2016
70-71 C p. 26-38
13 p.
article
33 Arc diagrams, flip distances, and Hamiltonian triangulations Cardinal, Jean
2018
70-71 C p. 206-225
article
34 Area bounds of rectilinear polygons realized by angle sequences Bae, Sang Won
2019
70-71 C p. 9-29
article
35 Assigning weights to minimize the covering radius in the plane Oh, Eunjin
2019
70-71 C p. 22-32
article
36 A streaming algorithm for 2-center with outliers in high dimensions Hatami, Behnam
2017
70-71 C p. 26-36
11 p.
article
37 Balanced line separators of unit disk graphs Carmi, Paz

70-71 C p.
article
38 1-bend upward planar slope number of SP-digraphs Di Giacomo, Emilio

70-71 C p.
article
39 Bottleneck detour tree of points on a path Aloupis, Greg
2019
70-71 C p. 30-36
article
40 Bottleneck partial-matching Voronoi diagrams and applications Henze, Matthias
2016
70-71 C p. 40-54
15 p.
article
41 Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions Atalay, F. Betul
2019
70-71 C p. 14-29
article
42 Bumpy pyramid folding Abel, Zachary R.
2018
70-71 C p. 22-31
article
43 Bundling three convex polygons to minimize area or perimeter Park, Dongwoo
2016
70-71 C p. 1-14
14 p.
article
44 CALL FOR PAPERS Computational Geometry: Theory and Applications Special Issue in Memoriam: Godfried Toussaint 2019
70-71 C p.
article
45 Closest-pair queries in fat rectangles Bae, Sang Won
2019
70-71 C p. 1-8
article
46 Colored anchored visibility representations in 2D and 3D space Binucci, Carla

70-71 C p.
article
47 Colored ray configurations Fabila-Monroy, Ruy
2018
70-71 C p. 292-308
article
48 Colored spanning graphs for set visualization Hurtado, Ferran
2018
70-71 C p. 262-276
article
49 Combinatorics and complexity of guarding polygons with edge and point 2-transmitters Cannon, Sarah
2018
70-71 C p. 89-100
article
50 Combinatorics of beacon-based routing in three dimensions Cleve, Jonas

70-71 C p.
article
51 Common developments of three incongruent boxes of area 30 Xu, Dawei
2017
70-71 C p. 1-12
12 p.
article
52 Compact drawings of 1-planar graphs with right-angle crossings and few bends Chaplick, Steven
2019
70-71 C p. 50-68
article
53 Complexity of simplicial homology and independence complexes of chordal graphs Adamaszek, Michał
2016
70-71 C p. 8-18
11 p.
article
54 Computing a geodesic two-center of points in a simple polygon Oh, Eunjin
2019
70-71 C p. 45-59
article
55 Computing a minimum-width square or rectangular annulus with outliers Bae, Sang Won
2019
70-71 C p. 33-45
article
56 Computing multiparameter persistent homology through a discrete Morse-based approach Scaramuccia, Sara

70-71 C p.
article
57 Computing the Fréchet distance between folded polygons Cook IV, Atlas F.
2015
70-71 C p. 1-16
16 p.
article
58 Computing the geodesic centers of a polygonal domain Bae, Sang Won
2019
70-71 C p. 3-9
article
59 Computing the similarity between moving curves Buchin, Kevin
2018
70-71 C p. 2-14
article
60 Cone-based spanners of constant degree Damian, Mirela
2018
70-71 C p. 48-61
article
61 Connecting a set of circles with minimum sum of radii Chambers, Erin W.
2018
70-71 C p. 62-76
article
62 Connectivity with directional antennas in the symmetric communication model Dobrev, S.
2016
70-71 C p. 1-25
25 p.
article
63 Constrained generalized Delaunay graphs are plane spanners Bose, Prosenjit
2018
70-71 C p. 50-65
article
64 Continuous Yao graphs Bakhshesh, Davood
2018
70-71 C p. 42-52
11 p.
article
65 Convex blocking and partial orders on the plane Díaz-Báñez, José Miguel
2016
70-71 C p. 55-66
12 p.
article
66 Convexity-increasing morphs of planar graphs Kleist, Linda
2019
70-71 C p. 69-88
article
67 Covering points with minimum/maximum area orthogonally convex polygons Evrendilek, Cem
2016
70-71 C p. 32-44
13 p.
article
68 Covering segments with unit squares Acharyya, Ankush
2019
70-71 C p. 1-13
article
69 Covering the plane by a sequence of circular disks with a constraint Bhattacharya, Amitava

70-71 C p.
article
70 C-planarity of embedded cyclic c-graphs Fulek, Radoslav
2017
70-71 C p. 1-13
article
71 Cross-sections of line configurations in R 3 and (d −2)-flat configurations in R d Aichholzer, Oswin
2019
70-71 C p. 51-61
article
72 Delaunay simplices in diagonally distorted lattices Choudhary, Aruni
2019
70-71 C p. 33-44
article
73 Dihedral deformation and rigidity Amenta, Nina

70-71 C p.
article
74 Discrete Voronoi games and ϵ-nets, in two and three dimensions Banik, Aritra
2016
70-71 C p. 41-58
18 p.
article
75 Distance-sensitive planar point location Aronov, Boris
2016
70-71 C p. 17-31
15 p.
article
76 Distinct distances between points and lines Sharir, Micha
2018
70-71 C p. 2-15
article
77 Drawing graphs with vertices and edges in convex position García-Marco, Ignacio
2016
70-71 C p. 25-33
9 p.
article
78 Drawing plane triangulations with few segments Durocher, Stephane
2019
70-71 C p. 27-39
article
79 Drawing the almost convex set in an integer grid of minimum size Duque, Frank
2017
70-71 C p. 1-11
article
80 Drawing the Horton set in an integer grid of minimum size Barba, Luis
2017
70-71 C p. 10-19
10 p.
article
81 Dynamic conflict-free colorings in the plane de Berg, Mark
2019
70-71 C p. 61-73
article
82 Dynamic data structures for approximate Hausdorff distance in the word RAM Chan, Timothy M.
2017
70-71 C p. 37-44
8 p.
article
83 Edge routing with ordered bundles Pupyrev, Sergey
2016
70-71 C p. 18-33
16 p.
article
84 Editorial Board 2019
70-71 C p. ii
article
85 Editorial Board 2019
70-71 C p. ii
article
86 Editorial Board 2019
70-71 C p. ii
article
87 Editorial Board 2019
70-71 C p. ii
article
88 Editorial Board 2019
70-71 C p. ii
article
89 Editorial Board 2018
70-71 C p. ii
article
90 Editorial Board 2019
70-71 C p. ii
article
91 Editorial Board 2019
70-71 C p. ii
article
92 Editorial Board 2019
70-71 C p. ii
article
93 Editorial Board
70-71 C p.
article
94 Editorial Board
70-71 C p.
article
95 Editorial Board 2019
70-71 C p.
article
96 Editorial Board 2018
70-71 C p. ii
article
97 Editorial Board 2019
70-71 C p. ii
article
98 Editorial Board 2018
70-71 C p. ii
article
99 Editorial Board 2018
70-71 C p. ii
article
100 Editorial Board 2018
70-71 C p. ii
article
101 Editorial Board
70-71 C p.
article
102 Editorial Board
70-71 C p.
article
103 Editorial Board
70-71 C p.
article
104 Editorial Board
70-71 C p.
article
105 Editorial Board
70-71 C p.
article
106 Editorial: EuroCG2015 Brodnik, Andrej
2018
70-71 C p. 1
article
107 Editorial: Special issue in memory of Dr. Ferran Hurtado Bose, Prosenjit
2018
70-71 C p. 1
article
108 Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG) He, Meng
2019
70-71 C p. 1-2
article
109 Editor's note Sack, Jörg-Rüdiger
2018
70-71 C p. 1
article
110 Efficient and robust persistent homology for measures Buchet, Mickaël
2016
70-71 C p. 70-96
27 p.
article
111 Elastic geometric shape matching for translations under the Manhattan norm Knauer, Christian
2018
70-71 C p. 57-69
article
112 Evacuating equilateral triangles and squares in the face-to-face model Chuangpishit, Huda

70-71 C p.
article
113 Exact Minkowski sums of polygons with holes Baram, Alon
2018
70-71 C p. 46-56
article
114 Extending Erdős–Beck's theorem to higher dimensions Do, Thao

70-71 C p.
article
115 Extending upward planar graph drawings Da Lozzo, Giordano

70-71 C p.
article
116 Fast and compact planar embeddings Ferres, Leo

70-71 C p.
article
117 Faster algorithms for growing prioritized disks and rectangles Ahn, Hee-Kap
2019
70-71 C p. 23-39
article
118 Faster bottleneck non-crossing matchings of points in convex position Savić, Marko
2017
70-71 C p. 27-34
article
119 Faster geometric algorithms via dynamic determinant computation Fisikopoulos, Vissarion
2016
70-71 C p. 1-16
16 p.
article
120 Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points Kaplan, Haim
2019
70-71 C p. 1-11
article
121 Finding largest rectangles in convex polygons Cabello, Sergio
2016
70-71 C p. 67-74
8 p.
article
122 Finding minimum witness sets in orthogonal polygons Aldana-Galván, I.

70-71 C p.
article
123 Finding pairwise intersections of rectangles in a query rectangle Oh, Eunjin
2019
70-71 C p.
article
124 Flip distance between two triangulations of a point set is NP-complete Lubiw, Anna
2015
70-71 C p. 17-23
7 p.
article
125 Flip distance to some plane configurations Biniaz, Ahmad
2019
70-71 C p. 12-21
article
126 Flipping edge-labelled triangulations Bose, Prosenjit
2018
70-71 C p. 309-326
article
127 Flips in edge-labelled pseudo-triangulations Bose, Prosenjit
2017
70-71 C p. 45-54
10 p.
article
128 FO model checking on geometric graphs Hliněný, Petr
2019
70-71 C p. 1-19
article
129 Forest-like abstract Voronoi diagrams in linear time Bohler, Cecilia
2018
70-71 C p. 134-145
article
130 Foreword Durocher, Stephane

70-71 C p.
article
131 Foreword of the editors 2015
70-71 C p. 1-
1 p.
article
132 Gathering by repulsion Bose, Prosenjit

70-71 C p.
article
133 Geometric clustering in normed planes Martín, Pedro
2019
70-71 C p. 50-60
article
134 Geometric permutations of non-overlapping unit balls revisited Ha, Jae-Soon
2016
70-71 C p. 36-50
15 p.
article
135 Guarding orthogonal art galleries with sliding cameras Durocher, Stephane
2017
70-71 C p. 12-26
article
136 Guest Editor's foreword Rappaport, David
2017
70-71 C p. 1-
1 p.
article
137 Hamiltonicity for convex shape Delaunay and Gabriel graphs Bose, Prosenjit

70-71 C p.
article
138 Holes in 2-convex point sets Aichholzer, Oswin
2018
70-71 C p. 38-49
article
139 Homotopic C -oriented routing with few links and thick edges Speckmann, Bettina
2018
70-71 C p. 11-28
18 p.
article
140 How to play hot and cold Haverkort, Herman

70-71 C p.
article
141 Improved approximation bounds for the minimum constraint removal problem Bandyapadhyay, Sayan

70-71 C p.
article
142 Improved bounds on the stretch factor of Y 4 Damian, Mirela
2017
70-71 C p. 14-24
11 p.
article
143 Improved PTASs for convex barrier coverage Carmi, Paz

70-71 C p.
article
144 Introducing article numbering to Computational Geometry: Theory and Applications Munao, Simone

70-71 C p.
article
145 K-dominance in multidimensional data: Theory and applications Schibler, Thomas

70-71 C p.
article
146 Kinetic k-Semi-Yao graph and its applications Rahmati, Zahed
2019
70-71 C p. 10-26
article
147 k-Sets and rectilinear crossings in complete uniform hypergraphs Gangopadhyay, Rahul

70-71 C p.
article
148 Linear transformation distance for bichromatic matchings Aichholzer, Oswin
2018
70-71 C p. 77-88
article
149 Locally correct Fréchet matchings Buchin, Kevin
2019
70-71 C p. 1-18
article
150 Many disjoint edges in topological graphs Ruiz-Vargas, Andres J.
2017
70-71 C p. 1-13
13 p.
article
151 Metric embedding, hyperbolic space, and social networks Verbeek, Kevin
2016
70-71 C p. 1-12
12 p.
article
152 Middle curves based on discrete Fréchet distance Ahn, Hee-Kap

70-71 C p.
article
153 Minimizing the continuous diameter when augmenting a geometric tree with a shortcut De Carufel, Jean-Lou

70-71 C p.
article
154 Minimizing the sum of distances to a server in a constraint network Carmi, Paz
2019
70-71 C p. 1-12
article
155 Minimum rectilinear Steiner tree of n points in the unit square Dumitrescu, Adrian
2018
70-71 C p. 253-261
article
156 Modem illumination of monotone polygons Aichholzer, Oswin
2018
70-71 C p. 101-118
article
157 Multiple covers with balls I: Inclusion–exclusion Edelsbrunner, Herbert
2018
70-71 C p. 119-133
article
158 Multivariate topology simplification Chattopadhyay, Amit
2016
70-71 C p. 1-24
24 p.
article
159 Near equipartitions of colored point sets Holmsen, Andreas F.
2017
70-71 C p. 35-42
article
160 Near-linear-time deterministic plane Steiner spanners for well-spaced point sets Borradaile, Glencora
2015
70-71 C p. 8-16
9 p.
article
161 New bounds on the maximum number of edges in k-quasi-planar graphs Suk, Andrew
2015
70-71 C p. 24-33
10 p.
article
162 New pruning rules for the Steiner tree problem and 2-connected Steiner network problem Brazil, Marcus
2019
70-71 C p. 37-49
article
163 Note on k-planar crossing numbers Pach, János
2018
70-71 C p. 2-6
article
164 On a conjecture of Karasev Lee, Seunghun
2018
70-71 C p. 1-10
article
165 On compact packings of the plane with circles of three radii Messerschmidt, Miek

70-71 C p.
article
166 On Hamiltonian alternating cycles and paths Claverol, Mercè
2018
70-71 C p. 146-166
article
167 On k-greedy routing algorithms Zhang, Huaming
2016
70-71 C p. 9-17
9 p.
article
168 Only distances are required to reconstruct submanifolds Boissonnat, Jean-Daniel
2017
70-71 C p. 32-67
article
169 On optimal disc covers and a new characterization of the Steiner center Yankelevsky, Yael
2016
70-71 C p. 1-8
8 p.
article
170 On orthogonally convex drawings of plane graphs Chang, Yi-Jun
2017
70-71 C p. 34-51
18 p.
article
171 On piercing numbers of families satisfying the (p,q) r property Keller, Chaya
2018
70-71 C p. 11-18
article
172 On pseudo-disk hypergraphs Aronov, Boris

70-71 C p.
article
173 On Romeo and Juliet problems: Minimizing distance-to-sight Ahn, Hee-Kap
2019
70-71 C p. 12-21
article
174 On the complexity of barrier resilience for fat regions and bounded ply Korman, Matias
2018
70-71 C p. 34-51
article
175 On the edge crossing properties of Euclidean minimum weight Laman graphs Bereg, Sergey
2016
70-71 C p. 15-24
10 p.
article
176 On the existence of ordinary triangles Fulek, Radoslav
2017
70-71 C p. 28-31
article
177 On the expected diameter, width, and complexity of a stochastic convex hull Xue, Jie
2019
70-71 C p. 16-31
article
178 On the minimum-area rectangular and square annulus problem Bae, Sang Won

70-71 C p.
article
179 On the number of touching pairs in a set of planar curves Györgyi, Péter
2018
70-71 C p. 29-37
9 p.
article
180 On the number of unit-area triangles spanned by convex grids in the plane Raz, Orit E.
2017
70-71 C p. 25-33
9 p.
article
181 On the O β -hull of a planar point set Alegría-Galicia, Carlos
2018
70-71 C p. 277-291
article
182 On the rectilinear crossing number of complete uniform hypergraphs Anshu, Anurag
2017
70-71 C p. 38-47
10 p.
article
183 On the separability of stochastic geometric objects, with applications Xue, Jie
2018
70-71 C p. 1-20
article
184 On the shortest separating cycle Dumitrescu, Adrian

70-71 C p.
article
185 On topological graphs with at most four crossings per edge Ackerman, Eyal
2019
70-71 C p.
article
186 On triangle cover contact graphs Sultana, Shaheena
2018
70-71 C p. 31-38
article
187 Optimal Art Gallery Localization is NP-hard Bose, Prosenjit

70-71 C p.
article
188 Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards Viglietta, Giovanni

70-71 C p.
article
189 Optimal randomized incremental construction for guaranteed logarithmic planar point location Hemmer, Michael
2016
70-71 C p. 110-123
14 p.
article
190 Optimal time-convex hull for a straight-line highway in L p -metrics Dai, Bang-Sin
2016
70-71 C p. 1-20
20 p.
article
191 Orthogonal graph drawing with inflexible edges Bläsius, Thomas
2016
70-71 C p. 26-40
15 p.
article
192 Orthogonal layout with optimal face complexity Alam, Md. Jawaherul
2017
70-71 C p. 40-52
13 p.
article
193 Output sensitive algorithms for approximate incidences and their applications Aiger, Dror

70-71 C p.
article
194 Pachinko Akitaya, Hugo A.
2018
70-71 C p. 226-242
article
195 Packing boundary-anchored rectangles and squares Biedl, Therese

70-71 C p.
article
196 Packing plane spanning graphs with short edges in complete geometric graphs Aichholzer, Oswin
2019
70-71 C p. 1-15
article
197 Packing plane spanning trees into a point set Biniaz, Ahmad

70-71 C p.
article
198 Parallel computation of alpha complexes for biomolecules Masood, Talha Bin

70-71 C p.
article
199 Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons Eder, Günther
2018
70-71 C p. 15-23
article
200 Partially walking a polygon Aurenhammer, Franz
2019
70-71 C p. 3-11
article
201 Partitioning orthogonal polygons into ≤ 8-vertex pieces, with application to an art gallery theorem Győri, Ervin
2016
70-71 C p. 13-25
13 p.
article
202 Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon Biniaz, Ahmad
2016
70-71 C p. 27-39
13 p.
article
203 Plane hop spanners for unit disk graphs: Simpler and better Biniaz, Ahmad

70-71 C p.
article
204 Point sets with many non-crossing perfect matchings Asinowski, Andrei
2018
70-71 C p. 7-33
article
205 Polygon guarding with orientation Tokekar, Pratap
2016
70-71 C p. 97-109
13 p.
article
206 Preface Friggstad, Zachary

70-71 C p.
article
207 Preface Ellen, Faith

70-71 C p.
article
208 Probing convex polygons with a wedge Bose, Prosenjit
2016
70-71 C p. 34-59
26 p.
article
209 Problems on track runners Dumitrescu, Adrian

70-71 C p.
article
210 Progressive simplification of polygonal curves Buchin, Kevin

70-71 C p.
article
211 Range closest-pair search in higher dimensions Chan, Timothy M.

70-71 C p.
article
212 Reconstructing embedded graphs from persistence diagrams Belton, Robin Lynne

70-71 C p.
article
213 Reconstruction of the path graph Keller, Chaya
2018
70-71 C p. 1-10
article
214 Rectilinear link diameter and radius in a rectilinear polygonal domain Arseneva, Elena

70-71 C p.
article
215 Reprint of: Approximating majority depth Chen, Dan
2015
70-71 C p. 2-7
6 p.
article
216 Reversibility and foldability of Conway tiles Akiyama, Jin
2017
70-71 C p. 30-45
16 p.
article
217 Reversibility properties of the fire-fighting problem in graphs Klein, Rolf
2018
70-71 C p. 38-41
4 p.
article
218 Routing in a polygonal terrain with the shortest beacon watchtower Kouhestani, Bahram
2018
70-71 C p. 34-47
article
219 Routing in polygonal domains Banyassady, Bahareh

70-71 C p.
article
220 Self-approaching paths in simple polygons Bose, Prosenjit

70-71 C p.
article
221 Separability of imprecise points Sheikhi, Farnaz
2017
70-71 C p. 24-37
14 p.
article
222 Shortcuts for the circle Bae, Sang Won
2019
70-71 C p. 37-54
article
223 Shortest paths and convex hulls in 2D complexes with non-positive curvature Lubiw, Anna

70-71 C p.
article
224 Smallest universal covers for families of triangles Park, Ji-won

70-71 C p.
article
225 γ-Soft packings of rectangles Brenner, Ulrich
2018
70-71 C p. 49-64
article
226 Soft subdivision motion planning for complex planar robots Zhou, Bo

70-71 C p.
article
227 Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword Polishchuk, Valentin

70-71 C p.
article
228 Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword Gudmundsson, Joachim

70-71 C p.
article
229 Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword Korman, Matias
2019
70-71 C p. 1-2
article
230 Spectral concentration and greedy k-clustering Dey, Tamal K.
2019
70-71 C p. 19-32
article
231 Steiner reducing sets of minimum weight triangulations: Structure and topology Traub, Cynthia M.
2015
70-71 C p. 24-36
13 p.
article
232 Strong matching of points with geometric shapes Biniaz, Ahmad
2018
70-71 C p. 186-205
article
233 Survivable minimum bottleneck networks Ras, C.J.
2015
70-71 C p. 17-23
7 p.
article
234 Symmetric assembly puzzles are hard, beyond a few pieces Demaine, Erik D.

70-71 C p.
article
235 Table cartogram Evans, William
2018
70-71 C p. 174-185
article
236 The discrete Voronoi game in R 2 Banik, Aritra
2017
70-71 C p. 53-62
10 p.
article
237 The dual diameter of triangulations Korman, Matias
2018
70-71 C p. 243-252
article
238 The geodesic 2-center problem in a simple polygon Oh, Eunjin
2018
70-71 C p. 21-37
article
239 The hamburger theorem Kano, Mikio
2018
70-71 C p. 167-173
article
240 The minimum convex container of two convex polytopes under translations Ahn, Hee-Kap
2019
70-71 C p. 40-50
article
241 The most-likely skyline problem for stochastic points Agrawal, Akash

70-71 C p.
article
242 The non-pure version of the simplex and the boundary of the simplex Capitelli, Nicolás A.
2016
70-71 C p. 19-26
8 p.
article
243 The VC-dimension of visibility on the boundary of monotone polygons Gibson, Matt
2019
70-71 C p. 62-72
article
244 Thickness and colorability of geometric graphs Durocher, Stephane
2016
70-71 C p. 1-18
18 p.
article
245 Thread-parallel mesh improvement using face and edge swapping and vertex insertion Zangeneh, Reza
2018
70-71 C p. 31-48
article
246 Tight bounds for beacon-based coverage in simple rectilinear polygons Bae, Sang Won
2019
70-71 C p. 40-52
article
247 Tight bounds for conflict-free chromatic guarding of orthogonal art galleries Hoffmann, Frank
2018
70-71 C p. 24-34
article
248 Tighter estimates for ϵ-nets for disks Bus, Norbert
2016
70-71 C p. 27-35
9 p.
article
249 Tilings of the regular N-gon with triangles of angles π/N,π/N,(N − 2)π/N for N = 5,8,10 and 12 Laczkovich, M.

70-71 C p.
article
250 Time–space trade-offs for triangulations and Voronoi diagrams Korman, Matias
2018
70-71 C p. 35-45
article
251 Topological inference of manifolds with boundary Wang, Yuan

70-71 C p.
article
252 Trajectory planning for an articulated probe Teo, Ka Yaw

70-71 C p.
article
253 T-shape visibility representations of 1-planar graphs Brandenburg, Franz J.
2018
70-71 C p. 16-30
article
254 Two disjoint 5-holes in point sets Scheucher, Manfred

70-71 C p.
article
255 Two-level rectilinear Steiner trees Held, Stephan
2017
70-71 C p. 48-59
12 p.
article
256 Two optimization problems for unit disks Cabello, Sergio
2018
70-71 C p. 1-12
article
257 Two theorems on point-flat incidences Lund, Ben

70-71 C p.
article
258 Universal hinge patterns for folding strips efficiently into any grid polyhedron Benbernou, Nadia M.

70-71 C p.
article
259 Visibility graphs, dismantlability, and the cops and robbers game Lubiw, Anna
2017
70-71 C p. 14-27
article
260 Visibility representations of boxes in 2.5 dimensions Arleo, Alessio
2018
70-71 C p. 19-33
article
261 (Weakly) Self-approaching geometric graphs and spanners Bakhshesh, Davood
2019
70-71 C p. 20-36
article
                             261 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands