Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             524 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A 4-approximation of the 2 π 3 -MST Ashur, Stav
70-71 C p.
 artikel
2 Accelerating iterated persistent homology computations with warm starts Luo, Yuan
70-71 C p.
 artikel
3 Acknowledgement of priority — A fractional Helly theorem for boxes Bárány, I.
 2018
 70-71 C p. 1-
1 p.
 artikel
4 Acrophobic guard watchtower problem Seth, Ritesh
70-71 C p.
 artikel
5 A 2D advancing-front Delaunay mesh refinement algorithm Sastry, Shankar P.
70-71 C p.
 artikel
6 A duality transform for constructing small grid embeddings of 3d polytopes Igamberdiev, Alexander
 2016
 70-71 C p. 19-36
18 p.
 artikel
7 Advice complexity of online non-crossing matching Mohammad Lavasani, Ali
70-71 C p.
 artikel
8 A fast algorithm for computing irreducible triangulations of closed surfaces in E d Ramaswami, Suneeta
 2018
 70-71 C p. 327-357
 artikel
9 Affine invariants of generalized polygons and matching under affine transformations Chávez, Edgar
 2016
 70-71 C p. 60-69
10 p.
 artikel
10 Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs Angelini, Patrizio
 2015
 70-71 C p. 34-48
15 p.
 artikel
11 Algorithms for computing closest points for segments Wang, Haitao
70-71 C p.
 artikel
12 Algorithms for radius-optimally augmenting trees in a metric space Gudmundsson, Joachim
70-71 C p.
 artikel
13 Algorithms for the line-constrained disk coverage and related problems Pedersen, Logan
70-71 C p.
 artikel
14 A linearized circle packing algorithm Orick, Gerald L.
 2017
 70-71 C p. 13-29
17 p.
 artikel
15 A linear optimization oracle for zonotope computation Deza, Antoine
70-71 C p.
 artikel
16 A linear-time algorithm for radius-optimally augmenting paths in a metric space Johnson, Christopher
70-71 C p.
 artikel
17 A lower bound for computing geometric spanners Farshi, Mohammad
 2016
 70-71 C p. 21-26
6 p.
 artikel
18 A lower bound on opaque sets Kawamura, Akitoshi
 2019
 70-71 C p. 13-22
 artikel
19 Alternating paths and cycles of minimum length Evans, W.
 2016
 70-71 C p. 124-135
12 p.
 artikel
20 Altitude terrain guarding and guarding uni-monotone polygons Daescu, Ovidiu
 2019
 70-71 C p. 22-35
 artikel
21 Amortized analysis of smooth quadtrees in all dimensions Bennett, Huck
 2017
 70-71 C p. 20-39
20 p.
 artikel
22 An algorithm for the construction of the tight span of finite subsets of the Manhattan plane Kılıç, Mehmet
70-71 C p.
 artikel
23 An algorithm for the maximum weight independent set problem on outerstring graphs Keil, J. Mark
 2017
 70-71 C p. 19-25
7 p.
 artikel
24 An algorithmic framework for the single source shortest path problem with applications to disk graphs Klost, Katharina
70-71 C p.
 artikel
25 An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments Bae, Sang Won
 2016
 70-71 C p. 34-43
10 p.
 artikel
26 Analysis of farthest point sampling for approximating geodesics in a graph Kamousi, Pegah
 2016
 70-71 C p. 1-7
7 p.
 artikel
27 An analytical representation of the 2d generalized balanced power diagram Jung, Christian
70-71 C p.
 artikel
28 An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets Bárány, Imre
70-71 C p.
 artikel
29 An efficient three-dimensional face recognition system based random forest and geodesic curves Nassih, Bouchra
70-71 C p.
 artikel
30 A new lower bound on the maximum number of plane graphs using production matrices Huemer, Clemens
 2019
 70-71 C p. 36-49
 artikel
31 An exact algorithm for the Euclidean k-Steiner tree problem Brazil, Marcus
70-71 C p.
 artikel
32 Angle-monotonicity of Delaunay triangulation Bakhshesh, Davood
70-71 C p.
 artikel
33 Angles of arc-polygons and Lombardi drawings of cacti Eppstein, David
70-71 C p.
 artikel
34 An improved algorithm for diameter-optimally augmenting paths in a metric space Wang, Haitao
 2018
 70-71 C p. 11-21
 artikel
35 An improved construction for spanners of disks Smid, Michiel
70-71 C p.
 artikel
36 An improved upper bound on dilation of regular polygons Sattari, Sattar
 2019
 70-71 C p. 53-68
 artikel
37 An Ω(n d ) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures Bauernöppel, Frank
70-71 C p.
 artikel
38 An optimal algorithm for L 1 shortest paths in unit-disk graphs Wang, Haitao
70-71 C p.
 artikel
39 An optimal algorithm for plane matchings in multipartite geometric graphs Biniaz, Ahmad
 2017
 70-71 C p. 1-9
9 p.
 artikel
40 A note on empty balanced tetrahedra in two-colored point sets in R 3 Díaz-Bañez, José-Miguel
70-71 C p.
 artikel
41 A note on interference in random networks Devroye, L.
 2018
 70-71 C p. 2-10
9 p.
 artikel
42 A note on the k-colored crossing ratio of dense geometric graphs Fabila-Monroy, Ruy
70-71 C p.
 artikel
43 A note on the minimum number of red lines needed to pierce the intersections of blue lines Huicochea, Mario
70-71 C p.
 artikel
44 Any platonic solid can transform to another by O(1) refoldings Demaine, Erik D.
70-71 C p.
 artikel
45 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.
 artikel
46 Approximate range closest-pair queries Xue, Jie
70-71 C p.
 artikel
47 Approximating dominating set on intersection graphs of rectangles and L -frames Bandyapadhyay, Sayan
 2019
 70-71 C p. 32-44
 artikel
48 Approximating Gromov-Hausdorff distance in Euclidean space Majhi, Sushovan
70-71 C p.
 artikel
49 Approximating the integral Fréchet distance Maheshwari, Anil
 2018
 70-71 C p. 13-30
 artikel
50 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.
 artikel
51 Approximating the packedness of polygonal curves Gudmundsson, Joachim
70-71 C p.
 artikel
52 Approximating the rectilinear crossing number Fox, Jacob
 2019
 70-71 C p. 45-53
 artikel
53 Approximation algorithms for geometric conflict free covering problems Banik, Aritra
70-71 C p.
 artikel
54 Approximation algorithms for Max Morse Matching Rathod, Abhishek
 2017
 70-71 C p. 1-23
23 p.
 artikel
55 Approximation algorithms for the unit disk cover problem in 2D and 3D Biniaz, Ahmad
 2017
 70-71 C p. 8-18
11 p.
 artikel
56 Approximation algorithms for 1-Wasserstein distance between persistence diagrams Chen, Samantha
70-71 C p.
 artikel
57 A product inequality for extreme distances Dumitrescu, Adrian
 2019
 70-71 C p.
 artikel
58 A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams Bohler, Cecilia
 2016
 70-71 C p. 26-38
13 p.
 artikel
59 Arc diagrams, flip distances, and Hamiltonian triangulations Cardinal, Jean
 2018
 70-71 C p. 206-225
 artikel
60 Area bounds of rectilinear polygons realized by angle sequences Bae, Sang Won
 2019
 70-71 C p. 9-29
 artikel
61 Assigning weights to minimize the covering radius in the plane Oh, Eunjin
 2019
 70-71 C p. 22-32
 artikel
62 A streaming algorithm for 2-center with outliers in high dimensions Hatami, Behnam
 2017
 70-71 C p. 26-36
11 p.
 artikel
63 Attraction-convexity and normal visibility Bose, Prosenjit
70-71 C p.
 artikel
64 Augmenting graphs to minimize the radius Gudmundsson, Joachim
70-71 C p.
 artikel
65 Automatic generation of formulae for polyominoes with a fixed perimeter defect Barequet, Gill
70-71 C p.
 artikel
66 Balanced line separators of unit disk graphs Carmi, Paz
70-71 C p.
 artikel
67 1-bend upward planar slope number of SP-digraphs Di Giacomo, Emilio
70-71 C p.
 artikel
68 Between shapes, using the Hausdorff distance van Kreveld, Marc
70-71 C p.
 artikel
69 Big line or big convex polygon Conlon, David
70-71 C p.
 artikel
70 Bisecting three classes of lines Pilz, Alexander
70-71 C p.
 artikel
71 Bottleneck detour tree of points on a path Aloupis, Greg
 2019
 70-71 C p. 30-36
 artikel
72 Bottleneck matching in the plane Katz, Matthew J.
70-71 C p.
 artikel
73 Bottleneck partial-matching Voronoi diagrams and applications Henze, Matthias
 2016
 70-71 C p. 40-54
15 p.
 artikel
74 Bounds on soft rectangle packing ratios Brecklinghaus, Judith
70-71 C p.
 artikel
75 Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions Atalay, F. Betul
 2019
 70-71 C p. 14-29
 artikel
76 Bounds on the edge-length ratio of 2-outerplanar graphs Di Giacomo, Emilio
70-71 C p.
 artikel
77 Bumpy pyramid folding Abel, Zachary R.
 2018
 70-71 C p. 22-31
 artikel
78 Bundling three convex polygons to minimize area or perimeter Park, Dongwoo
 2016
 70-71 C p. 1-14
14 p.
 artikel
79 CALL FOR PAPERS Computational Geometry: Theory and Applications Special Issue in Memoriam: Godfried Toussaint 2019
 70-71 C p.
 artikel
80 CGTA Bekos, Michael A.
70-71 C p.
 artikel
81 CGTA Awards Ahn, Hee-Kap
70-71 C p.
 artikel
82 Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment Daescu, Ovidiu
70-71 C p.
 artikel
83 Closest-pair queries and minimum-weight queries are equivalent for squares Kazi, Abrar
70-71 C p.
 artikel
84 Closest-pair queries in fat rectangles Bae, Sang Won
 2019
 70-71 C p. 1-8
 artikel
85 Clustering with faulty centers Fox, Emily
70-71 C p.
 artikel
86 Colored anchored visibility representations in 2D and 3D space Binucci, Carla
70-71 C p.
 artikel
87 Colored ray configurations Fabila-Monroy, Ruy
 2018
 70-71 C p. 292-308
 artikel
88 Colored spanning graphs for set visualization Hurtado, Ferran
 2018
 70-71 C p. 262-276
 artikel
89 Coloring Delaunay-edges and their generalizations Ackerman, Eyal
70-71 C p.
 artikel
90 Colouring bottomless rectangles and arborescences Cardinal, Jean
70-71 C p.
 artikel
91 Combinatorics and complexity of guarding polygons with edge and point 2-transmitters Cannon, Sarah
 2018
 70-71 C p. 89-100
 artikel
92 Combinatorics of beacon-based routing in three dimensions Cleve, Jonas
70-71 C p.
 artikel
93 Common developments of three incongruent boxes of area 30 Xu, Dawei
 2017
 70-71 C p. 1-12
12 p.
 artikel
94 Compact drawings of 1-planar graphs with right-angle crossings and few bends Chaplick, Steven
 2019
 70-71 C p. 50-68
 artikel
95 Complexity of simplicial homology and independence complexes of chordal graphs Adamaszek, Michał
 2016
 70-71 C p. 8-18
11 p.
 artikel
96 Complexity results on untangling red-blue matchings Das, Arun Kumar
70-71 C p.
 artikel
97 Compression for 2-parameter persistent homology Fugacci, Ulderico
70-71 C p.
 artikel
98 Computation of spatial skyline points Bhattacharya, Binay
70-71 C p.
 artikel
99 Computing a geodesic two-center of points in a simple polygon Oh, Eunjin
 2019
 70-71 C p. 45-59
 artikel
100 Computing a minimum-width square or rectangular annulus with outliers Bae, Sang Won
 2019
 70-71 C p. 33-45
 artikel
101 Computing discrete harmonic differential forms in a given cohomology class using finite element exterior calculus Hirani, Anil N.
70-71 C p.
 artikel
102 Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization Heaton, Alexander
70-71 C p.
 artikel
103 Computing maximum independent set on outerstring graphs and their relatives Bose, Prosenjit
70-71 C p.
 artikel
104 Computing multiparameter persistent homology through a discrete Morse-based approach Scaramuccia, Sara
70-71 C p.
 artikel
105 Computing the Fréchet distance between folded polygons Cook IV, Atlas F.
 2015
 70-71 C p. 1-16
16 p.
 artikel
106 Computing the Fréchet distance between uncertain curves in one dimension Buchin, Kevin
70-71 C p.
 artikel
107 Computing the geodesic centers of a polygonal domain Bae, Sang Won
 2019
 70-71 C p. 3-9
 artikel
108 Computing the similarity between moving curves Buchin, Kevin
 2018
 70-71 C p. 2-14
 artikel
109 Concatenation arguments and their applications to polyominoes and polycubes Barequet, Gill
70-71 C p.
 artikel
110 Cone-based spanners of constant degree Damian, Mirela
 2018
 70-71 C p. 48-61
 artikel
111 Connected matchings Aichholzer, Oswin
70-71 C p.
 artikel
112 Connecting a set of circles with minimum sum of radii Chambers, Erin W.
 2018
 70-71 C p. 62-76
 artikel
113 Connectivity of spaces of directed paths in geometric models for concurrent computation Raussen, Martin
70-71 C p.
 artikel
114 Connectivity with directional antennas in the symmetric communication model Dobrev, S.
 2016
 70-71 C p. 1-25
25 p.
 artikel
115 Constrained boundary labeling Depian, Thomas
70-71 C p.
 artikel
116 Constrained generalized Delaunay graphs are plane spanners Bose, Prosenjit
 2018
 70-71 C p. 50-65
 artikel
117 Continuous flattening of all polyhedral manifolds using countably infinite creases Abel, Zachary
70-71 C p.
 artikel
118 Continuous Yao graphs Bakhshesh, Davood
 2018
 70-71 C p. 42-52
11 p.
 artikel
119 Convex blocking and partial orders on the plane Díaz-Báñez, José Miguel
 2016
 70-71 C p. 55-66
12 p.
 artikel
120 Convexity-increasing morphs of planar graphs Kleist, Linda
 2019
 70-71 C p. 69-88
 artikel
121 Corrigendum to “Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points” [Comput. Geom. 60 (2017) 2–7] Chan, Timothy M.
70-71 C p.
 artikel
122 Covering convex polygons by two congruent disks Choi, Jongmin
70-71 C p.
 artikel
123 Covering points with minimum/maximum area orthogonally convex polygons Evrendilek, Cem
 2016
 70-71 C p. 32-44
13 p.
 artikel
124 Covering segments with unit squares Acharyya, Ankush
 2019
 70-71 C p. 1-13
 artikel
125 Covering the plane by a sequence of circular disks with a constraint Bhattacharya, Amitava
70-71 C p.
 artikel
126 C-planarity of embedded cyclic c-graphs Fulek, Radoslav
 2017
 70-71 C p. 1-13
 artikel
127 Crossing lemma for the odd-crossing number Karl, János
70-71 C p.
 artikel
128 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
 artikel
129 Cut locus realizations on convex polyhedra O'Rourke, Joseph
70-71 C p.
 artikel
130 Decomposing filtered chain complexes: Geometry behind barcoding algorithms Chachólski, Wojciech
70-71 C p.
 artikel
131 Decomposition of geometric graphs into star-forests Pach, János
70-71 C p.
 artikel
132 Delaunay simplices in diagonally distorted lattices Choudhary, Aruni
 2019
 70-71 C p. 33-44
 artikel
133 Density of triangulated ternary disc packings Fernique, Thomas
70-71 C p.
 artikel
134 Developing a tetramonohedron with minimum cut length Demaine, Erik D.
70-71 C p.
 artikel
135 Dihedral deformation and rigidity Amenta, Nina
70-71 C p.
 artikel
136 Discrete Fréchet distance for closed curves Vodolazskiy, Evgeniy
70-71 C p.
 artikel
137 Discrete Voronoi games and ϵ-nets, in two and three dimensions Banik, Aritra
 2016
 70-71 C p. 41-58
18 p.
 artikel
138 Distance measures for embedded graphs Akitaya, Hugo A.
70-71 C p.
 artikel
139 Distance measures for geometric graphs Majhi, Sushovan
70-71 C p.
 artikel
140 Distance queries over dynamic interval graphs Chen, Jingbang
70-71 C p.
 artikel
141 Distance-sensitive planar point location Aronov, Boris
 2016
 70-71 C p. 17-31
15 p.
 artikel
142 Distinct distances between points and lines Sharir, Micha
 2018
 70-71 C p. 2-15
 artikel
143 Distinct distances with ℓ p metrics Matthews Jr., Polly
70-71 C p.
 artikel
144 Drawing graphs with vertices and edges in convex position García-Marco, Ignacio
 2016
 70-71 C p. 25-33
9 p.
 artikel
145 Drawing outerplanar graphs using thirteen edge lengths Bakhajian, Ziv
70-71 C p.
 artikel
146 Drawing plane triangulations with few segments Durocher, Stephane
 2019
 70-71 C p. 27-39
 artikel
147 Drawing the almost convex set in an integer grid of minimum size Duque, Frank
 2017
 70-71 C p. 1-11
 artikel
148 Drawing the Horton set in an integer grid of minimum size Barba, Luis
 2017
 70-71 C p. 10-19
10 p.
 artikel
149 Dynamic conflict-free colorings in the plane de Berg, Mark
 2019
 70-71 C p. 61-73
 artikel
150 Dynamic data structures for approximate Hausdorff distance in the word RAM Chan, Timothy M.
 2017
 70-71 C p. 37-44
8 p.
 artikel
151 Dynamic data structures for k-nearest neighbor queries de Berg, Sarita
70-71 C p.
 artikel
152 Dynamic layers of maxima with applications to dominating queries Kipouridis, E.
70-71 C p.
 artikel
153 Edge guards for polyhedra in three-space Cano, Javier
70-71 C p.
 artikel
154 Edge routing with ordered bundles Pupyrev, Sergey
 2016
 70-71 C p. 18-33
16 p.
 artikel
155 Edge-unfolding nested prismatoids Radons, Manuel
70-71 C p.
 artikel
156 Editorial Held, Martin
70-71 C p.
 artikel
157 Editorial Mchedlidze, Tamara
70-71 C p.
 artikel
158 Editorial Buchin, Kevin
70-71 C p.
 artikel
159 Editorial Di Giacomo, Emilio
70-71 C p.
 artikel
160 Editorial Bae, Sang Won
70-71 C p.
 artikel
161 Editorial Board
70-71 C p.
 artikel
162 Editorial Board
70-71 C p.
 artikel
163 Editorial Board
70-71 C p.
 artikel
164 Editorial Board
70-71 C p.
 artikel
165 Editorial Board 2018
 70-71 C p. ii
 artikel
166 Editorial Board 2018
 70-71 C p. ii
 artikel
167 Editorial Board 2018
 70-71 C p. ii
 artikel
168 Editorial Board 2019
 70-71 C p. ii
 artikel
169 Editorial Board 2019
 70-71 C p. ii
 artikel
170 Editorial Board 2019
 70-71 C p. ii
 artikel
171 Editorial Board 2019
 70-71 C p. ii
 artikel
172 Editorial Board 2019
 70-71 C p. ii
 artikel
173 Editorial Board 2018
 70-71 C p. ii
 artikel
174 Editorial Board 2019
 70-71 C p. ii
 artikel
175 Editorial Board 2019
 70-71 C p. ii
 artikel
176 Editorial Board 2019
 70-71 C p. ii
 artikel
177 Editorial Board
70-71 C p.
 artikel
178 Editorial Board
70-71 C p.
 artikel
179 Editorial Board 2019
 70-71 C p.
 artikel
180 Editorial Board 2018
 70-71 C p. ii
 artikel
181 Editorial Board 2019
 70-71 C p. ii
 artikel
182 Editorial Board
70-71 C p.
 artikel
183 Editorial Board
70-71 C p.
 artikel
184 Editorial Board
70-71 C p.
 artikel
185 Editorial Board
70-71 C p.
 artikel
186 Editorial Board
70-71 C p.
 artikel
187 Editorial Board
70-71 C p.
 artikel
188 Editorial Board
70-71 C p.
 artikel
189 Editorial Board
70-71 C p.
 artikel
190 Editorial Board
70-71 C p.
 artikel
191 Editorial Board
70-71 C p.
 artikel
192 Editorial Board
70-71 C p.
 artikel
193 Editorial Board
70-71 C p.
 artikel
194 Editorial Board
70-71 C p.
 artikel
195 Editorial Board
70-71 C p.
 artikel
196 Editorial Board
70-71 C p.
 artikel
197 Editorial Board
70-71 C p.
 artikel
198 Editorial Board
70-71 C p.
 artikel
199 Editorial Board
70-71 C p.
 artikel
200 Editorial Board
70-71 C p.
 artikel
201 Editorial Board
70-71 C p.
 artikel
202 Editorial Board
70-71 C p.
 artikel
203 Editorial Board
70-71 C p.
 artikel
204 Editorial Board
70-71 C p.
 artikel
205 Editorial Board
70-71 C p.
 artikel
206 Editorial Board
70-71 C p.
 artikel
207 Editorial Board
70-71 C p.
 artikel
208 Editorial Board
70-71 C p.
 artikel
209 Editorial Board
70-71 C p.
 artikel
210 Editorial Board
70-71 C p.
 artikel
211 Editorial Board
70-71 C p.
 artikel
212 Editorial Board
70-71 C p.
 artikel
213 Editorial Board
70-71 C p.
 artikel
214 Editorial Board
70-71 C p.
 artikel
215 Editorial Board
70-71 C p.
 artikel
216 Editorial Board
70-71 C p.
 artikel
217 Editorial Board
70-71 C p.
 artikel
218 Editorial Board
70-71 C p.
 artikel
219 Editorial: EuroCG2015 Brodnik, Andrej
 2018
 70-71 C p. 1
 artikel
220 Editorial: Special issue in memory of Dr. Ferran Hurtado Bose, Prosenjit
 2018
 70-71 C p. 1
 artikel
221 Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG) He, Meng
 2019
 70-71 C p. 1-2
 artikel
222 Editor's note Sack, Jörg-Rüdiger
 2018
 70-71 C p. 1
 artikel
223 Efficient and robust persistent homology for measures Buchet, Mickaël
 2016
 70-71 C p. 70-96
27 p.
 artikel
224 Efficient planar two-center algorithms Choi, Jongmin
70-71 C p.
 artikel
225 Efficient segment folding is hard Horiyama, Takashi
70-71 C p.
 artikel
226 Elastic geometric shape matching for translations under the Manhattan norm Knauer, Christian
 2018
 70-71 C p. 57-69
 artikel
227 Embeddings and near-neighbor searching with constant additive error for hyperbolic spaces Park, Eunku
70-71 C p.
 artikel
228 Empty rainbow triangles in k-colored point sets Fabila-Monroy, Ruy
70-71 C p.
 artikel
229 Engineering an algorithm for constructing low-stretch geometric graphs with near-greedy average degrees Shariful, FNU
70-71 C p.
 artikel
230 Enumerating combinatorial resultant trees Malić, Goran
70-71 C p.
 artikel
231 Erratum to: “Densest Lattice Packings of 3–Polytopes” [Computational Geometry 16 (2000) 157–186] Henk, Martin
70-71 C p.
 artikel
232 Euclidean minimum spanning trees with independent and dependent geometric uncertainties Gitik, Rivka
70-71 C p.
 artikel
233 Evacuating equilateral triangles and squares in the face-to-face model Chuangpishit, Huda
70-71 C p.
 artikel
234 Exact Minkowski sums of polygons with holes Baram, Alon
 2018
 70-71 C p. 46-56
 artikel
235 Expected size of random Tukey layers and convex layers Guo, Zhengyang
70-71 C p.
 artikel
236 Experiments with unit disk cover algorithms for covering massive pointsets Friederich, Rachel
70-71 C p.
 artikel
237 Extending Erdős–Beck's theorem to higher dimensions Do, Thao
70-71 C p.
 artikel
238 Extending upward planar graph drawings Da Lozzo, Giordano
70-71 C p.
 artikel
239 Extremal convex polygons inscribed in a given convex polygon Ködmön, Csenge Lili
70-71 C p.
 artikel
240 Faradžev Read-type enumeration of non-isomorphic CC systems Banković, Milan
70-71 C p.
 artikel
241 Fast and compact planar embeddings Ferres, Leo
70-71 C p.
 artikel
242 Faster algorithms for growing prioritized disks and rectangles Ahn, Hee-Kap
 2019
 70-71 C p. 23-39
 artikel
243 Faster bottleneck non-crossing matchings of points in convex position Savić, Marko
 2017
 70-71 C p. 27-34
 artikel
244 Faster geometric algorithms via dynamic determinant computation Fisikopoulos, Vissarion
 2016
 70-71 C p. 1-16
16 p.
 artikel
245 Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points Kaplan, Haim
 2019
 70-71 C p. 1-11
 artikel
246 Finding largest rectangles in convex polygons Cabello, Sergio
 2016
 70-71 C p. 67-74
8 p.
 artikel
247 Finding minimum witness sets in orthogonal polygons Aldana-Galván, I.
70-71 C p.
 artikel
248 Finding pairwise intersections of rectangles in a query rectangle Oh, Eunjin
 2019
 70-71 C p.
 artikel
249 Flexibility and rigidity of frameworks consisting of triangles and parallelograms Grasegger, Georg
70-71 C p.
 artikel
250 Flip distance between two triangulations of a point set is NP-complete Lubiw, Anna
 2015
 70-71 C p. 17-23
7 p.
 artikel
251 Flip distance to some plane configurations Biniaz, Ahmad
 2019
 70-71 C p. 12-21
 artikel
252 Flipping edge-labelled triangulations Bose, Prosenjit
 2018
 70-71 C p. 309-326
 artikel
253 Flipping in spirals Verdonschot, Sander
70-71 C p.
 artikel
254 Flips in edge-labelled pseudo-triangulations Bose, Prosenjit
 2017
 70-71 C p. 45-54
10 p.
 artikel
255 Flips in odd matchings Aichholzer, Oswin
70-71 C p.
 artikel
256 Folding polyiamonds into octahedra Stehr, Eva
70-71 C p.
 artikel
257 Folding polyominoes with holes into a cube Aichholzer, Oswin
70-71 C p.
 artikel
258 FO model checking on geometric graphs Hliněný, Petr
 2019
 70-71 C p. 1-19
 artikel
259 Forest-like abstract Voronoi diagrams in linear time Bohler, Cecilia
 2018
 70-71 C p. 134-145
 artikel
260 Foreword Durocher, Stephane
70-71 C p.
 artikel
261 Foreword of the editors 2015
 70-71 C p. 1-
1 p.
 artikel
262 Fréchet distance between two point sets Buchin, Maike
70-71 C p.
 artikel
263 From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem Curry, Justin
70-71 C p.
 artikel
264 Gathering by repulsion Bose, Prosenjit
70-71 C p.
 artikel
265 Generalized class cover problem with axis-parallel strips Mudgal, Apurva
70-71 C p.
 artikel
266 Geodesic obstacle representation of graphs Bose, Prosenjit
70-71 C p.
 artikel
267 Geometric and algorithmic solutions to the generalised alibi query Jansen, Arthur
70-71 C p.
 artikel
268 Geometric clustering in normed planes Martín, Pedro
 2019
 70-71 C p. 50-60
 artikel
269 Geometric dominating-set and set-cover via local-search De, Minati
70-71 C p.
 artikel
270 Geometric dominating sets - a minimum version of the No-Three-In-Line Problem Aichholzer, Oswin
70-71 C p.
 artikel
271 Geometric firefighting in the half-plane Kim, Sang-Sub
70-71 C p.
 artikel
272 Geometric permutations of non-overlapping unit balls revisited Ha, Jae-Soon
 2016
 70-71 C p. 36-50
15 p.
 artikel
273 Geometric triangulations and discrete Laplacians on manifolds: An update Glickenstein, David
70-71 C p.
 artikel
274 Geometric TSP on sets Alkema, Henk
70-71 C p.
 artikel
275 Global strong convexity and characterization of critical points of time-of-arrival-based source localization Pun, Yuen-Man
70-71 C p.
 artikel
276 δ-Greedy t-spanner Abu-Affash, A. Karim
70-71 C p.
 artikel
277 Grid drawings of graphs with constant edge-vertex resolution Bekos, Michael A.
70-71 C p.
 artikel
278 Growth rates of the number of empty triangles and simplices Bhattacharya, Bhaswar B.
70-71 C p.
 artikel
279 Guarantees on nearest-neighbor condensation heuristics Flores-Velazco, Alejandro
70-71 C p.
 artikel
280 Guarding orthogonal art galleries with sliding cameras Durocher, Stephane
 2017
 70-71 C p. 12-26
 artikel
281 Guarding points on a terrain by watchtowers Kang, Byeonguk
70-71 C p.
 artikel
282 Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG) He, Meng
70-71 C p.
 artikel
283 Guest Editor's foreword Rappaport, David
 2017
 70-71 C p. 1-
1 p.
 artikel
284 Half-plane point retrieval queries with independent and dependent geometric uncertainties Gitik, Rivka
70-71 C p.
 artikel
285 Hamiltonicity for convex shape Delaunay and Gabriel graphs Bose, Prosenjit
70-71 C p.
 artikel
286 Hierarchical categories in colored searching Afshani, Peyman
70-71 C p.
 artikel
287 Holes in 2-convex point sets Aichholzer, Oswin
 2018
 70-71 C p. 38-49
 artikel
288 Homotopic C -oriented routing with few links and thick edges Speckmann, Bettina
 2018
 70-71 C p. 11-28
18 p.
 artikel
289 How close is a quad mesh to a polycube? Baumeister, Markus
70-71 C p.
 artikel
290 How to play hot and cold Haverkort, Herman
70-71 C p.
 artikel
291 Impartial achievement games on convex geometries McCoy, Stephanie
70-71 C p.
 artikel
292 Implementing straight skeletons with exact arithmetic: Challenges and experiences Eder, Günther
70-71 C p.
 artikel
293 Improved algorithms for the bichromatic two-center problem for pairs of points Wang, Haitao
70-71 C p.
 artikel
294 Improved approximation bounds for the minimum constraint removal problem Bandyapadhyay, Sayan
70-71 C p.
 artikel
295 Improved approximation for two-dimensional vector multiple knapsack Cohen, Tomer
70-71 C p.
 artikel
296 Improved bounds on the stretch factor of Y 4 Damian, Mirela
 2017
 70-71 C p. 14-24
11 p.
 artikel
297 Improved PTASs for convex barrier coverage Carmi, Paz
70-71 C p.
 artikel
298 Infinite circle packings on surfaces with conical singularities Bowers, Philip L.
70-71 C p.
 artikel
299 Influence-based Voronoi diagrams of clusters Huang, Ziyun
70-71 C p.
 artikel
300 Inserting an edge into a geometric embedding Radermacher, Marcel
70-71 C p.
 artikel
301 Intersecting disks using two congruent disks Kang, Byeonguk
70-71 C p.
 artikel
302 Introducing article numbering to Computational Geometry: Theory and Applications Munao, Simone
70-71 C p.
 artikel
303 I/O-efficient 2-d orthogonal range skyline and attrition priority queues Kejlberg-Rasmussen, Casper
70-71 C p.
 artikel
304 Isometric and affine copies of a set in volumetric Helly results Messina, John A.
70-71 C p.
 artikel
305 Isometric deformations of discrete and smooth T-surfaces Izmestiev, Ivan
70-71 C p.
 artikel
306 K-dominance in multidimensional data: Theory and applications Schibler, Thomas
70-71 C p.
 artikel
307 Keep your distance: Land division with separation Elkind, Edith
70-71 C p.
 artikel
308 Kinetic k-Semi-Yao graph and its applications Rahmati, Zahed
 2019
 70-71 C p. 10-26
 artikel
309 k-Sets and rectilinear crossings in complete uniform hypergraphs Gangopadhyay, Rahul
70-71 C p.
 artikel
310 Labeling nonograms: Boundary labeling for curve arrangements Klute, Fabian
70-71 C p.
 artikel
311 Largest and smallest area triangles on imprecise points Keikha, Vahideh
70-71 C p.
 artikel
312 Largest triangles in a polygon Lee, Seungjun
70-71 C p.
 artikel
313 Largest unit rectangles inscribed in a convex polygon Chung, Jaehoon
70-71 C p.
 artikel
314 Layered drawing of undirected graphs with generalized port constraints Zink, Johannes
70-71 C p.
 artikel
315 Linear-size planar Manhattan network for convex point sets Jana, Satyabrata
70-71 C p.
 artikel
316 Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces Cho, Kyungjin
70-71 C p.
 artikel
317 Linear transformation distance for bichromatic matchings Aichholzer, Oswin
 2018
 70-71 C p. 77-88
 artikel
318 Line segment visibility with sidedness constraints Lenchner, Jonathan
70-71 C p.
 artikel
319 Lions and contamination: Monotone clearings Bertschinger, Daniel
70-71 C p.
 artikel
320 Locally correct Fréchet matchings Buchin, Kevin
 2019
 70-71 C p. 1-18
 artikel
321 Many disjoint edges in topological graphs Ruiz-Vargas, Andres J.
 2017
 70-71 C p. 1-13
13 p.
 artikel
322 Many order types on integer grids of polynomial size Scheucher, Manfred
70-71 C p.
 artikel
323 Maximum-area and maximum-perimeter rectangles in polygons Choi, Yujin
70-71 C p.
 artikel
324 Maximum number of almost similar triangles in the plane Balogh, József
70-71 C p.
 artikel
325 Maximum-width empty square and rectangular annulus Bae, Sang Won
70-71 C p.
 artikel
326 Maximum-width rainbow-bisecting empty annulus Bae, Sang Won
70-71 C p.
 artikel
327 Metric embedding, hyperbolic space, and social networks Verbeek, Kevin
 2016
 70-71 C p. 1-12
12 p.
 artikel
328 Middle curves based on discrete Fréchet distance Ahn, Hee-Kap
70-71 C p.
 artikel
329 Minimizing the continuous diameter when augmenting a geometric tree with a shortcut De Carufel, Jean-Lou
70-71 C p.
 artikel
330 Minimizing the sum of distances to a server in a constraint network Carmi, Paz
 2019
 70-71 C p. 1-12
 artikel
331 Minimum cuts in geometric intersection graphs Cabello, Sergio
70-71 C p.
 artikel
332 Minimum-link shortest paths for polygons amidst rectilinear obstacles Kim, Mincheol
70-71 C p.
 artikel
333 Minimum ply covering of points with disks and squares Biedl, Therese
70-71 C p.
 artikel
334 Minimum rectilinear polygons for given angle sequences Evans, William S.
70-71 C p.
 artikel
335 Minimum rectilinear Steiner tree of n points in the unit square Dumitrescu, Adrian
 2018
 70-71 C p. 253-261
 artikel
336 Minimum-width double-slabs and widest empty slabs in high dimensions Ahn, Taehoon
70-71 C p.
 artikel
337 Modem illumination of monotone polygons Aichholzer, Oswin
 2018
 70-71 C p. 101-118
 artikel
338 Multiple covers with balls I: Inclusion–exclusion Edelsbrunner, Herbert
 2018
 70-71 C p. 119-133
 artikel
339 Multi-robot motion planning for unit discs with revolving areas Agarwal, Pankaj K.
70-71 C p.
 artikel
340 Multivariate topology simplification Chattopadhyay, Amit
 2016
 70-71 C p. 1-24
24 p.
 artikel
341 m-Watchmen's routes in minbar and generalized minbar polygons Ghasemi, Rahmat
70-71 C p.
 artikel
342 Navigating planar topologies in near-optimal space and time Fuentes-Sepúlveda, José
70-71 C p.
 artikel
343 Near equipartitions of colored point sets Holmsen, Andreas F.
 2017
 70-71 C p. 35-42
 artikel
344 Near-linear-time deterministic plane Steiner spanners for well-spaced point sets Borradaile, Glencora
 2015
 70-71 C p. 8-16
9 p.
 artikel
345 New bounds on the maximum number of edges in k-quasi-planar graphs Suk, Andrew
 2015
 70-71 C p. 24-33
10 p.
 artikel
346 New formulas for cup-i products and fast computation of Steenrod squares Medina-Mardones, Anibal M.
70-71 C p.
 artikel
347 New pruning rules for the Steiner tree problem and 2-connected Steiner network problem Brazil, Marcus
 2019
 70-71 C p. 37-49
 artikel
348 Note on k-planar crossing numbers Pach, János
 2018
 70-71 C p. 2-6
 artikel
349 On a conjecture of Karasev Lee, Seunghun
 2018
 70-71 C p. 1-10
 artikel
350 On algorithmic complexity of imprecise spanners Poureidi, Abolfazl
70-71 C p.
 artikel
351 On compact packings of the plane with circles of three radii Messerschmidt, Miek
70-71 C p.
 artikel
352 On crossing-families in planar point sets Aichholzer, Oswin
70-71 C p.
 artikel
353 On dominating set of some subclasses of string graphs Chakraborty, Dibyayan
70-71 C p.
 artikel
354 On exact covering with unit disks Chun, Ji Hoon
70-71 C p.
 artikel
355 On Hamiltonian alternating cycles and paths Claverol, Mercè
 2018
 70-71 C p. 146-166
 artikel
356 On interval decomposability of 2D persistence modules Asashiba, Hideto
70-71 C p.
 artikel
357 On k-greedy routing algorithms Zhang, Huaming
 2016
 70-71 C p. 9-17
9 p.
 artikel
358 Online class cover problem De, Minati
70-71 C p.
 artikel
359 On line-separable weighted unit-disk coverage and related problems Liu, Gang
70-71 C p.
 artikel
360 Only distances are required to reconstruct submanifolds Boissonnat, Jean-Daniel
 2017
 70-71 C p. 32-67
 artikel
361 On optimal disc covers and a new characterization of the Steiner center Yankelevsky, Yael
 2016
 70-71 C p. 1-8
8 p.
 artikel
362 On orthogonally convex drawings of plane graphs Chang, Yi-Jun
 2017
 70-71 C p. 34-51
18 p.
 artikel
363 On path-greedy geometric spanners Evans, William
70-71 C p.
 artikel
364 On piercing numbers of families satisfying the (p,q) r property Keller, Chaya
 2018
 70-71 C p. 11-18
 artikel
365 On prescribing total orders and preorders to pairwise distances of points in Euclidean space Almendra-Hernández, Víctor Hugo
70-71 C p.
 artikel
366 On pseudo-disk hypergraphs Aronov, Boris
70-71 C p.
 artikel
367 On reverse shortest paths in geometric proximity graphs Agarwal, Pankaj K.
70-71 C p.
 artikel
368 On Romeo and Juliet problems: Minimizing distance-to-sight Ahn, Hee-Kap
 2019
 70-71 C p. 12-21
 artikel
369 On the approximation of shortest escape paths Kübel, David
70-71 C p.
 artikel
370 On the complexity of barrier resilience for fat regions and bounded ply Korman, Matias
 2018
 70-71 C p. 34-51
 artikel
371 On the edge crossing properties of Euclidean minimum weight Laman graphs Bereg, Sergey
 2016
 70-71 C p. 15-24
10 p.
 artikel
372 On the enumeration of integer tetrahedra East, James
70-71 C p.
 artikel
373 On the existence of ordinary triangles Fulek, Radoslav
 2017
 70-71 C p. 28-31
 artikel
374 On the expected diameter, width, and complexity of a stochastic convex hull Xue, Jie
 2019
 70-71 C p. 16-31
 artikel
375 On the geometric priority set cover problem Banik, Aritra
70-71 C p.
 artikel
376 On the line-separable unit-disk coverage and related problems Liu, Gang
70-71 C p.
 artikel
377 On the minimum-area rectangular and square annulus problem Bae, Sang Won
70-71 C p.
 artikel
378 On the number of order types in integer grids of small size Caraballo, Luis E.
70-71 C p.
 artikel
379 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.
 artikel
380 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.
 artikel
381 On the O β -hull of a planar point set Alegría-Galicia, Carlos
 2018
 70-71 C p. 277-291
 artikel
382 On the orthogonal Grünbaum partition problem in dimension three Maldonado, Gerardo L.
70-71 C p.
 artikel
383 On the plane angle-monotone graphs Bakhshesh, Davood
70-71 C p.
 artikel
384 On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs Eder, Günther
70-71 C p.
 artikel
385 On the rectilinear crossing number of complete balanced multipartite graphs and balanced layered graphs Fabila-Monroy, Ruy
70-71 C p.
 artikel
386 On the rectilinear crossing number of complete uniform hypergraphs Anshu, Anurag
 2017
 70-71 C p. 38-47
10 p.
 artikel
387 On the separability of stochastic geometric objects, with applications Xue, Jie
 2018
 70-71 C p. 1-20
 artikel
388 On the shortest separating cycle Dumitrescu, Adrian
70-71 C p.
 artikel
389 On the spanning and routing ratios of the directed Θ6-graph Akitaya, Hugo A.
70-71 C p.
 artikel
390 On the upper bound on the average distance from the Fermat-Weber center of a convex body Tan, Xuehou
70-71 C p.
 artikel
391 On topological graphs with at most four crossings per edge Ackerman, Eyal
 2019
 70-71 C p.
 artikel
392 On triangle cover contact graphs Sultana, Shaheena
 2018
 70-71 C p. 31-38
 artikel
393 Optimal Art Gallery Localization is NP-hard Bose, Prosenjit
70-71 C p.
 artikel
394 Optimally guarding 2-reflex orthogonal polyhedra by reflex edge guards Viglietta, Giovanni
70-71 C p.
 artikel
395 Optimal randomized incremental construction for guaranteed logarithmic planar point location Hemmer, Michael
 2016
 70-71 C p. 110-123
14 p.
 artikel
396 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.
 artikel
397 Orthogonal graph drawing with inflexible edges Bläsius, Thomas
 2016
 70-71 C p. 26-40
15 p.
 artikel
398 Orthogonal layout with optimal face complexity Alam, Md. Jawaherul
 2017
 70-71 C p. 40-52
13 p.
 artikel
399 Output sensitive algorithms for approximate incidences and their applications Aiger, Dror
70-71 C p.
 artikel
400 Pachinko Akitaya, Hugo A.
 2018
 70-71 C p. 226-242
 artikel
401 Packing boundary-anchored rectangles and squares Biedl, Therese
70-71 C p.
 artikel
402 Packing plane spanning graphs with short edges in complete geometric graphs Aichholzer, Oswin
 2019
 70-71 C p. 1-15
 artikel
403 Packing plane spanning trees into a point set Biniaz, Ahmad
70-71 C p.
 artikel
404 Packing unequal disks in the Euclidean plane Fernique, Thomas
70-71 C p.
 artikel
405 Panel-point model for rigidity and flexibility analysis of rigid origami Hayakawa, Kentaro
70-71 C p.
 artikel
406 Parallel computation of alpha complexes for biomolecules Masood, Talha Bin
70-71 C p.
 artikel
407 Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons Eder, Günther
 2018
 70-71 C p. 15-23
 artikel
408 Parallel line centers with guaranteed separation Chung, Chaeyoon
70-71 C p.
 artikel
409 Parameterized inapproximability of Morse matching Bauer, Ulrich
70-71 C p.
 artikel
410 Partially walking a polygon Aurenhammer, Franz
 2019
 70-71 C p. 3-11
 artikel
411 Partial matchings induced by morphisms between persistence modules Gonzalez-Diaz, R.
70-71 C p.
 artikel
412 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.
 artikel
413 Pattern formation for fat robots with memory Alsaedi, Rusul J.
70-71 C p.
 artikel
414 Persistent homology in ℓ ∞ metric Beltramo, Gabriele
70-71 C p.
 artikel
415 Piercing families of convex sets in the plane that avoid a certain subfamily with lines McGinnis, Daniel
70-71 C p.
 artikel
416 Piercing pairwise intersecting geodesic disks Bose, Prosenjit
70-71 C p.
 artikel
417 Piercing pairwise intersecting geodesic disks by five points Abu-Affash, A. Karim
70-71 C p.
 artikel
418 Piercing unit geodesic disks Biniaz, Ahmad
70-71 C p.
 artikel
419 1-planarity testing and embedding: An experimental study Binucci, Carla
70-71 C p.
 artikel
420 Planar rectilinear drawings of outerplanar graphs in linear time Frati, Fabrizio
70-71 C p.
 artikel
421 Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon Biniaz, Ahmad
 2016
 70-71 C p. 27-39
13 p.
 artikel
422 Plane hop spanners for unit disk graphs: Simpler and better Biniaz, Ahmad
70-71 C p.
 artikel
423 Point sets with many non-crossing perfect matchings Asinowski, Andrei
 2018
 70-71 C p. 7-33
 artikel
424 Polygon guarding with orientation Tokekar, Pratap
 2016
 70-71 C p. 97-109
13 p.
 artikel
425 Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises Calès, Ludovic
70-71 C p.
 artikel
426 Preface He, Meng
70-71 C p.
 artikel
427 Preface De Carufel, Jean-Lou
70-71 C p.
 artikel
428 Preface Friggstad, Zachary
70-71 C p.
 artikel
429 Preface Ellen, Faith
70-71 C p.
 artikel
430 Probing convex polygons with a wedge Bose, Prosenjit
 2016
 70-71 C p. 34-59
26 p.
 artikel
431 Problems on track runners Dumitrescu, Adrian
70-71 C p.
 artikel
432 Progressive simplification of polygonal curves Buchin, Kevin
70-71 C p.
 artikel
433 Range closest-pair search in higher dimensions Chan, Timothy M.
70-71 C p.
 artikel
434 Range updates and range sum queries on multidimensional points with monoid weights Lu, Shangqi
70-71 C p.
 artikel
435 Rational tensegrities through the lens of toric geometry Mohammadi, Fatemeh
70-71 C p.
 artikel
436 Realizability of free spaces of curves Akitaya, Hugo A.
70-71 C p.
 artikel
437 Realizable dimension of periodic frameworks Oba, Ryoshun
70-71 C p.
 artikel
438 Rearranging a sequence of points onto a line Ahn, Taehoon
70-71 C p.
 artikel
439 Reconstructing embedded graphs from persistence diagrams Belton, Robin Lynne
70-71 C p.
 artikel
440 Reconstruction of the path graph Keller, Chaya
 2018
 70-71 C p. 1-10
 artikel
441 Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions Afshani, Peyman
70-71 C p.
 artikel
442 Rectangular partitions of a rectilinear polygon Kim, Hwi
70-71 C p.
 artikel
443 Rectangular Spiral Galaxies are still hard Demaine, Erik D.
70-71 C p.
 artikel
444 Rectilinear link diameter and radius in a rectilinear polygonal domain Arseneva, Elena
70-71 C p.
 artikel
445 Reprint of: Approximating majority depth Chen, Dan
 2015
 70-71 C p. 2-7
6 p.
 artikel
446 Reversibility and foldability of Conway tiles Akiyama, Jin
 2017
 70-71 C p. 30-45
16 p.
 artikel
447 Reversibility properties of the fire-fighting problem in graphs Klein, Rolf
 2018
 70-71 C p. 38-41
4 p.
 artikel
448 Revisiting the Fréchet distance between piecewise smooth curves Conradi, Jacobus
70-71 C p.
 artikel
449 Routing by matching on convex pieces of grid graphs Alpert, H.
70-71 C p.
 artikel
450 Routing in a polygonal terrain with the shortest beacon watchtower Kouhestani, Bahram
 2018
 70-71 C p. 34-47
 artikel
451 Routing in polygonal domains Banyassady, Bahareh
70-71 C p.
 artikel
452 Routing on heavy path WSPD spanners Bose, Prosenjit
70-71 C p.
 artikel
453 Self-approaching paths in simple polygons Bose, Prosenjit
70-71 C p.
 artikel
454 Separability of imprecise points Sheikhi, Farnaz
 2017
 70-71 C p. 24-37
14 p.
 artikel
455 Shortcut hulls: Vertex-restricted outer simplifications of polygons Bonerath, Annika
70-71 C p.
 artikel
456 Shortcuts for the circle Bae, Sang Won
 2019
 70-71 C p. 37-54
 artikel
457 Shortest paths and convex hulls in 2D complexes with non-positive curvature Lubiw, Anna
70-71 C p.
 artikel
458 Shortest rectilinear path queries to rectangles in a rectangular domain Kim, Mincheol
70-71 C p.
 artikel
459 Simple linear time algorithms for piercing pairwise intersecting disks Biniaz, Ahmad
70-71 C p.
 artikel
460 Simplex closing probabilities in directed graphs Unger, Florian
70-71 C p.
 artikel
461 Simultaneous visibility representations of undirected pairs of graphs Chugg, Ben
70-71 C p.
 artikel
462 Smallest universal covers for families of triangles Park, Ji-won
70-71 C p.
 artikel
463 Snipperclips: Cutting tools into desired polygons using themselves Abel, Zachary
70-71 C p.
 artikel
464 γ-Soft packings of rectangles Brenner, Ulrich
 2018
 70-71 C p. 49-64
 artikel
465 Soft subdivision motion planning for complex planar robots Zhou, Bo
70-71 C p.
 artikel
466 Solving the minimum convex partition of point sets with integer programming Sapucaia, Allan
70-71 C p.
 artikel
467 Sparse convex hull coverage Klimenko, Georgiy
70-71 C p.
 artikel
468 Sparse hop spanners for unit disk graphs Dumitrescu, Adrian
70-71 C p.
 artikel
469 Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword Polishchuk, Valentin
70-71 C p.
 artikel
470 Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword Gudmundsson, Joachim
70-71 C p.
 artikel
471 Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword Korman, Matias
 2019
 70-71 C p. 1-2
 artikel
472 Spectral concentration and greedy k-clustering Dey, Tamal K.
 2019
 70-71 C p. 19-32
 artikel
473 Steiner reducing sets of minimum weight triangulations: Structure and topology Traub, Cynthia M.
 2015
 70-71 C p. 24-36
13 p.
 artikel
474 Straight-line drawings of 1-planar graphs Brandenburg, Franz J.
70-71 C p.
 artikel
475 Strong matching of points with geometric shapes Biniaz, Ahmad
 2018
 70-71 C p. 186-205
 artikel
476 Structured discrete shape approximation: Theoretical complexity and practical algorithm Tillmann, Andreas M.
70-71 C p.
 artikel
477 Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model Aronov, Boris
70-71 C p.
 artikel
478 Survivable minimum bottleneck networks Ras, C.J.
 2015
 70-71 C p. 17-23
7 p.
 artikel
479 Symmetric assembly puzzles are hard, beyond a few pieces Demaine, Erik D.
70-71 C p.
 artikel
480 Table cartogram Evans, William
 2018
 70-71 C p. 174-185
 artikel
481 Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains Ashur, Stav
70-71 C p.
 artikel
482 The constant of point–line incidence constructions Balko, Martin
70-71 C p.
 artikel
483 The discrete Voronoi game in R 2 Banik, Aritra
 2017
 70-71 C p. 53-62
10 p.
 artikel
484 The dispersive art gallery problem Rieck, Christian
70-71 C p.
 artikel
485 The dual diameter of triangulations Korman, Matias
 2018
 70-71 C p. 243-252
 artikel
486 The geodesic 2-center problem in a simple polygon Oh, Eunjin
 2018
 70-71 C p. 21-37
 artikel
487 The hamburger theorem Kano, Mikio
 2018
 70-71 C p. 167-173
 artikel
488 The impact of geometry on monochrome regions in the flip Schelling process Bläsius, Thomas
70-71 C p.
 artikel
489 The maximum exposure problem Kumar, Neeraj
70-71 C p.
 artikel
490 The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms Guimarães, Dilson Almeida
70-71 C p.
 artikel
491 The minimum convex container of two convex polytopes under translations Ahn, Hee-Kap
 2019
 70-71 C p. 40-50
 artikel
492 The most-likely skyline problem for stochastic points Agrawal, Akash
70-71 C p.
 artikel
493 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.
 artikel
494 The parameterized complexity of finding minimum bounded chains Blaser, Nello
70-71 C p.
 artikel
495 The prefix Fréchet similarity Scheffer, Christian
70-71 C p.
 artikel
496 The VC-dimension of visibility on the boundary of monotone polygons Gibson, Matt
 2019
 70-71 C p. 62-72
 artikel
497 Thickness and colorability of geometric graphs Durocher, Stephane
 2016
 70-71 C p. 1-18
18 p.
 artikel
498 Thread-parallel mesh improvement using face and edge swapping and vertex insertion Zangeneh, Reza
 2018
 70-71 C p. 31-48
 artikel
499 Tight bounds for beacon-based coverage in simple rectilinear polygons Bae, Sang Won
 2019
 70-71 C p. 40-52
 artikel
500 Tight bounds for conflict-free chromatic guarding of orthogonal art galleries Hoffmann, Frank
 2018
 70-71 C p. 24-34
 artikel
501 Tighter estimates for ϵ-nets for disks Bus, Norbert
 2016
 70-71 C p. 27-35
9 p.
 artikel
502 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.
 artikel
503 Time and space efficient collinearity indexing Aronov, Boris
70-71 C p.
 artikel
504 Time–space trade-offs for triangulations and Voronoi diagrams Korman, Matias
 2018
 70-71 C p. 35-45
 artikel
505 Topological inference of manifolds with boundary Wang, Yuan
70-71 C p.
 artikel
506 Topological regularization via persistence-sensitive optimization Nigmetov, Arnur
70-71 C p.
 artikel
507 Trajectory planning for an articulated probe Teo, Ka Yaw
70-71 C p.
 artikel
508 T-shape visibility representations of 1-planar graphs Brandenburg, Franz J.
 2018
 70-71 C p. 16-30
 artikel
509 Two disjoint 5-holes in point sets Scheucher, Manfred
70-71 C p.
 artikel
510 Two-level rectilinear Steiner trees Held, Stephan
 2017
 70-71 C p. 48-59
12 p.
 artikel
511 Two optimization problems for unit disks Cabello, Sergio
 2018
 70-71 C p. 1-12
 artikel
512 Two theorems on point-flat incidences Lund, Ben
70-71 C p.
 artikel
513 Unfolding polycube trees with constant refinement Damian, Mirela
70-71 C p.
 artikel
514 Unfoldings and nets of regular polytopes Devadoss, Satyan L.
70-71 C p.
 artikel
515 Unfolding 3-separated polycube graphs of arbitrary genus Damian, Mirela
70-71 C p.
 artikel
516 Universal hinge patterns for folding strips efficiently into any grid polyhedron Benbernou, Nadia M.
70-71 C p.
 artikel
517 Universality of persistence diagrams and the bottleneck and Wasserstein distances Bubenik, Peter
70-71 C p.
 artikel
518 Untangling circular drawings: Algorithms and complexity Bhore, Sujoy
70-71 C p.
 artikel
519 Ununfoldable polyhedra with 6 vertices or 6 faces Akitaya, Hugo A.
70-71 C p.
 artikel
520 Value-offset bifiltrations for digital images De, Anway
70-71 C p.
 artikel
521 VHS: A package for homological simplification of voxelized plant root data for skeletonization Chambers, Erin W.
70-71 C p.
 artikel
522 Visibility graphs, dismantlability, and the cops and robbers game Lubiw, Anna
 2017
 70-71 C p. 14-27
 artikel
523 Visibility representations of boxes in 2.5 dimensions Arleo, Alessio
 2018
 70-71 C p. 19-33
 artikel
524 (Weakly) Self-approaching geometric graphs and spanners Bakhshesh, Davood
 2019
 70-71 C p. 20-36
 artikel
                             524 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland