Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             281 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Acknowledgement of priority — A fractional Helly theorem for boxes Bárány, I.
2018
70-71 C p. 1-
1 p.
artikel
2 A duality transform for constructing small grid embeddings of 3d polytopes Igamberdiev, Alexander
2016
70-71 C p. 19-36
18 p.
artikel
3 A fast algorithm for computing irreducible triangulations of closed surfaces in E d Ramaswami, Suneeta
2018
70-71 C p. 327-357
artikel
4 Affine invariants of generalized polygons and matching under affine transformations Chávez, Edgar
2016
70-71 C p. 60-69
10 p.
artikel
5 Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs Angelini, Patrizio
2015
70-71 C p. 34-48
15 p.
artikel
6 A linearized circle packing algorithm Orick, Gerald L.
2017
70-71 C p. 13-29
17 p.
artikel
7 A lower bound for computing geometric spanners Farshi, Mohammad
2016
70-71 C p. 21-26
6 p.
artikel
8 A lower bound on opaque sets Kawamura, Akitoshi
2019
70-71 C p. 13-22
artikel
9 Alternating paths and cycles of minimum length Evans, W.
2016
70-71 C p. 124-135
12 p.
artikel
10 Altitude terrain guarding and guarding uni-monotone polygons Daescu, Ovidiu
2019
70-71 C p. 22-35
artikel
11 Amortized analysis of smooth quadtrees in all dimensions Bennett, Huck
2017
70-71 C p. 20-39
20 p.
artikel
12 An algorithm for the construction of the tight span of finite subsets of the Manhattan plane Kılıç, Mehmet

70-71 C p.
artikel
13 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
14 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
15 Analysis of farthest point sampling for approximating geodesics in a graph Kamousi, Pegah
2016
70-71 C p. 1-7
7 p.
artikel
16 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
17 A new lower bound on the maximum number of plane graphs using production matrices Huemer, Clemens
2019
70-71 C p. 36-49
artikel
18 Angle-monotonicity of Delaunay triangulation Bakhshesh, Davood

70-71 C p.
artikel
19 An improved algorithm for diameter-optimally augmenting paths in a metric space Wang, Haitao
2018
70-71 C p. 11-21
artikel
20 An improved construction for spanners of disks Smid, Michiel

70-71 C p.
artikel
21 An improved upper bound on dilation of regular polygons Sattari, Sattar
2019
70-71 C p. 53-68
artikel
22 An optimal algorithm for plane matchings in multipartite geometric graphs Biniaz, Ahmad
2017
70-71 C p. 1-9
9 p.
artikel
23 A note on interference in random networks Devroye, L.
2018
70-71 C p. 2-10
9 p.
artikel
24 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
25 Approximate range closest-pair queries Xue, Jie

70-71 C p.
artikel
26 Approximating dominating set on intersection graphs of rectangles and L -frames Bandyapadhyay, Sayan
2019
70-71 C p. 32-44
artikel
27 Approximating the integral Fréchet distance Maheshwari, Anil
2018
70-71 C p. 13-30
artikel
28 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
29 Approximating the rectilinear crossing number Fox, Jacob
2019
70-71 C p. 45-53
artikel
30 Approximation algorithms for geometric conflict free covering problems Banik, Aritra

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

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

70-71 C p.
artikel
41 Bottleneck detour tree of points on a path Aloupis, Greg
2019
70-71 C p. 30-36
artikel
42 Bottleneck partial-matching Voronoi diagrams and applications Henze, Matthias
2016
70-71 C p. 40-54
15 p.
artikel
43 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
44 Bumpy pyramid folding Abel, Zachary R.
2018
70-71 C p. 22-31
artikel
45 Bundling three convex polygons to minimize area or perimeter Park, Dongwoo
2016
70-71 C p. 1-14
14 p.
artikel
46 CALL FOR PAPERS Computational Geometry: Theory and Applications Special Issue in Memoriam: Godfried Toussaint 2019
70-71 C p.
artikel
47 Closest-pair queries in fat rectangles Bae, Sang Won
2019
70-71 C p. 1-8
artikel
48 Colored anchored visibility representations in 2D and 3D space Binucci, Carla

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

70-71 C p.
artikel
53 Common developments of three incongruent boxes of area 30 Xu, Dawei
2017
70-71 C p. 1-12
12 p.
artikel
54 Compact drawings of 1-planar graphs with right-angle crossings and few bends Chaplick, Steven
2019
70-71 C p. 50-68
artikel
55 Complexity of simplicial homology and independence complexes of chordal graphs Adamaszek, Michał
2016
70-71 C p. 8-18
11 p.
artikel
56 Computation of spatial skyline points Bhattacharya, Binay

70-71 C p.
artikel
57 Computing a geodesic two-center of points in a simple polygon Oh, Eunjin
2019
70-71 C p. 45-59
artikel
58 Computing a minimum-width square or rectangular annulus with outliers Bae, Sang Won
2019
70-71 C p. 33-45
artikel
59 Computing multiparameter persistent homology through a discrete Morse-based approach Scaramuccia, Sara

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

70-71 C p.
artikel
73 C-planarity of embedded cyclic c-graphs Fulek, Radoslav
2017
70-71 C p. 1-13
artikel
74 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
75 Delaunay simplices in diagonally distorted lattices Choudhary, Aruni
2019
70-71 C p. 33-44
artikel
76 Dihedral deformation and rigidity Amenta, Nina

70-71 C p.
artikel
77 Discrete Voronoi games and ϵ-nets, in two and three dimensions Banik, Aritra
2016
70-71 C p. 41-58
18 p.
artikel
78 Distance measures for embedded graphs Akitaya, Hugo A.

70-71 C p.
artikel
79 Distance-sensitive planar point location Aronov, Boris
2016
70-71 C p. 17-31
15 p.
artikel
80 Distinct distances between points and lines Sharir, Micha
2018
70-71 C p. 2-15
artikel
81 Drawing graphs with vertices and edges in convex position García-Marco, Ignacio
2016
70-71 C p. 25-33
9 p.
artikel
82 Drawing plane triangulations with few segments Durocher, Stephane
2019
70-71 C p. 27-39
artikel
83 Drawing the almost convex set in an integer grid of minimum size Duque, Frank
2017
70-71 C p. 1-11
artikel
84 Drawing the Horton set in an integer grid of minimum size Barba, Luis
2017
70-71 C p. 10-19
10 p.
artikel
85 Dynamic conflict-free colorings in the plane de Berg, Mark
2019
70-71 C p. 61-73
artikel
86 Dynamic data structures for approximate Hausdorff distance in the word RAM Chan, Timothy M.
2017
70-71 C p. 37-44
8 p.
artikel
87 Dynamic layers of maxima with applications to dominating queries Kipouridis, E.

70-71 C p.
artikel
88 Edge routing with ordered bundles Pupyrev, Sergey
2016
70-71 C p. 18-33
16 p.
artikel
89 Editorial Board 2019
70-71 C p. ii
artikel
90 Editorial Board 2019
70-71 C p. ii
artikel
91 Editorial Board 2019
70-71 C p. ii
artikel
92 Editorial Board 2019
70-71 C p. ii
artikel
93 Editorial Board 2019
70-71 C p. ii
artikel
94 Editorial Board 2018
70-71 C p. ii
artikel
95 Editorial Board 2019
70-71 C p. ii
artikel
96 Editorial Board 2019
70-71 C p. ii
artikel
97 Editorial Board 2019
70-71 C p. ii
artikel
98 Editorial Board
70-71 C p.
artikel
99 Editorial Board
70-71 C p.
artikel
100 Editorial Board 2019
70-71 C p.
artikel
101 Editorial Board 2018
70-71 C p. ii
artikel
102 Editorial Board 2019
70-71 C p. ii
artikel
103 Editorial Board 2018
70-71 C p. ii
artikel
104 Editorial Board 2018
70-71 C p. ii
artikel
105 Editorial Board 2018
70-71 C p. ii
artikel
106 Editorial Board
70-71 C p.
artikel
107 Editorial Board
70-71 C p.
artikel
108 Editorial Board
70-71 C p.
artikel
109 Editorial Board
70-71 C p.
artikel
110 Editorial Board
70-71 C p.
artikel
111 Editorial Board
70-71 C p.
artikel
112 Editorial Board
70-71 C p.
artikel
113 Editorial Board
70-71 C p.
artikel
114 Editorial: EuroCG2015 Brodnik, Andrej
2018
70-71 C p. 1
artikel
115 Editorial: Special issue in memory of Dr. Ferran Hurtado Bose, Prosenjit
2018
70-71 C p. 1
artikel
116 Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG) He, Meng
2019
70-71 C p. 1-2
artikel
117 Editor's note Sack, Jörg-Rüdiger
2018
70-71 C p. 1
artikel
118 Efficient and robust persistent homology for measures Buchet, Mickaël
2016
70-71 C p. 70-96
27 p.
artikel
119 Elastic geometric shape matching for translations under the Manhattan norm Knauer, Christian
2018
70-71 C p. 57-69
artikel
120 Empty rainbow triangles in k-colored point sets Fabila-Monroy, Ruy

70-71 C p.
artikel
121 Evacuating equilateral triangles and squares in the face-to-face model Chuangpishit, Huda

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

70-71 C p.
artikel
124 Extending upward planar graph drawings Da Lozzo, Giordano

70-71 C p.
artikel
125 Fast and compact planar embeddings Ferres, Leo

70-71 C p.
artikel
126 Faster algorithms for growing prioritized disks and rectangles Ahn, Hee-Kap
2019
70-71 C p. 23-39
artikel
127 Faster bottleneck non-crossing matchings of points in convex position Savić, Marko
2017
70-71 C p. 27-34
artikel
128 Faster geometric algorithms via dynamic determinant computation Fisikopoulos, Vissarion
2016
70-71 C p. 1-16
16 p.
artikel
129 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
130 Finding largest rectangles in convex polygons Cabello, Sergio
2016
70-71 C p. 67-74
8 p.
artikel
131 Finding minimum witness sets in orthogonal polygons Aldana-Galván, I.

70-71 C p.
artikel
132 Finding pairwise intersections of rectangles in a query rectangle Oh, Eunjin
2019
70-71 C p.
artikel
133 Flip distance between two triangulations of a point set is NP-complete Lubiw, Anna
2015
70-71 C p. 17-23
7 p.
artikel
134 Flip distance to some plane configurations Biniaz, Ahmad
2019
70-71 C p. 12-21
artikel
135 Flipping edge-labelled triangulations Bose, Prosenjit
2018
70-71 C p. 309-326
artikel
136 Flipping in spirals Verdonschot, Sander

70-71 C p.
artikel
137 Flips in edge-labelled pseudo-triangulations Bose, Prosenjit
2017
70-71 C p. 45-54
10 p.
artikel
138 Folding polyominoes with holes into a cube Aichholzer, Oswin

70-71 C p.
artikel
139 FO model checking on geometric graphs Hliněný, Petr
2019
70-71 C p. 1-19
artikel
140 Forest-like abstract Voronoi diagrams in linear time Bohler, Cecilia
2018
70-71 C p. 134-145
artikel
141 Foreword Durocher, Stephane

70-71 C p.
artikel
142 Foreword of the editors 2015
70-71 C p. 1-
1 p.
artikel
143 Gathering by repulsion Bose, Prosenjit

70-71 C p.
artikel
144 Geometric clustering in normed planes Martín, Pedro
2019
70-71 C p. 50-60
artikel
145 Geometric firefighting in the half-plane Kim, Sang-Sub

70-71 C p.
artikel
146 Geometric permutations of non-overlapping unit balls revisited Ha, Jae-Soon
2016
70-71 C p. 36-50
15 p.
artikel
147 Guarantees on nearest-neighbor condensation heuristics Flores-Velazco, Alejandro

70-71 C p.
artikel
148 Guarding orthogonal art galleries with sliding cameras Durocher, Stephane
2017
70-71 C p. 12-26
artikel
149 Guest Editor's foreword Rappaport, David
2017
70-71 C p. 1-
1 p.
artikel
150 Hamiltonicity for convex shape Delaunay and Gabriel graphs Bose, Prosenjit

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

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

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

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

70-71 C p.
artikel
158 I/O-efficient 2-d orthogonal range skyline and attrition priority queues Kejlberg-Rasmussen, Casper

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

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

70-71 C p.
artikel
162 Largest and smallest area triangles on imprecise points Keikha, Vahideh

70-71 C p.
artikel
163 Linear transformation distance for bichromatic matchings Aichholzer, Oswin
2018
70-71 C p. 77-88
artikel
164 Locally correct Fréchet matchings Buchin, Kevin
2019
70-71 C p. 1-18
artikel
165 Many disjoint edges in topological graphs Ruiz-Vargas, Andres J.
2017
70-71 C p. 1-13
13 p.
artikel
166 Maximum-area and maximum-perimeter rectangles in polygons Choi, Yujin

70-71 C p.
artikel
167 Metric embedding, hyperbolic space, and social networks Verbeek, Kevin
2016
70-71 C p. 1-12
12 p.
artikel
168 Middle curves based on discrete Fréchet distance Ahn, Hee-Kap

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

70-71 C p.
artikel
170 Minimizing the sum of distances to a server in a constraint network Carmi, Paz
2019
70-71 C p. 1-12
artikel
171 Minimum cuts in geometric intersection graphs Cabello, Sergio

70-71 C p.
artikel
172 Minimum ply covering of points with disks and squares Biedl, Therese

70-71 C p.
artikel
173 Minimum rectilinear Steiner tree of n points in the unit square Dumitrescu, Adrian
2018
70-71 C p. 253-261
artikel
174 Modem illumination of monotone polygons Aichholzer, Oswin
2018
70-71 C p. 101-118
artikel
175 Multiple covers with balls I: Inclusion–exclusion Edelsbrunner, Herbert
2018
70-71 C p. 119-133
artikel
176 Multivariate topology simplification Chattopadhyay, Amit
2016
70-71 C p. 1-24
24 p.
artikel
177 Near equipartitions of colored point sets Holmsen, Andreas F.
2017
70-71 C p. 35-42
artikel
178 Near-linear-time deterministic plane Steiner spanners for well-spaced point sets Borradaile, Glencora
2015
70-71 C p. 8-16
9 p.
artikel
179 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
180 New pruning rules for the Steiner tree problem and 2-connected Steiner network problem Brazil, Marcus
2019
70-71 C p. 37-49
artikel
181 Note on k-planar crossing numbers Pach, János
2018
70-71 C p. 2-6
artikel
182 On a conjecture of Karasev Lee, Seunghun
2018
70-71 C p. 1-10
artikel
183 On compact packings of the plane with circles of three radii Messerschmidt, Miek

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

70-71 C p.
artikel
191 On Romeo and Juliet problems: Minimizing distance-to-sight Ahn, Hee-Kap
2019
70-71 C p. 12-21
artikel
192 On the approximation of shortest escape paths Kübel, David

70-71 C p.
artikel
193 On the complexity of barrier resilience for fat regions and bounded ply Korman, Matias
2018
70-71 C p. 34-51
artikel
194 On the edge crossing properties of Euclidean minimum weight Laman graphs Bereg, Sergey
2016
70-71 C p. 15-24
10 p.
artikel
195 On the existence of ordinary triangles Fulek, Radoslav
2017
70-71 C p. 28-31
artikel
196 On the expected diameter, width, and complexity of a stochastic convex hull Xue, Jie
2019
70-71 C p. 16-31
artikel
197 On the minimum-area rectangular and square annulus problem Bae, Sang Won

70-71 C p.
artikel
198 On the number of order types in integer grids of small size Caraballo, Luis E.

70-71 C p.
artikel
199 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
200 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
201 On the O β -hull of a planar point set Alegría-Galicia, Carlos
2018
70-71 C p. 277-291
artikel
202 On the rectilinear crossing number of complete uniform hypergraphs Anshu, Anurag
2017
70-71 C p. 38-47
10 p.
artikel
203 On the separability of stochastic geometric objects, with applications Xue, Jie
2018
70-71 C p. 1-20
artikel
204 On the shortest separating cycle Dumitrescu, Adrian

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

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

70-71 C p.
artikel
209 Optimal randomized incremental construction for guaranteed logarithmic planar point location Hemmer, Michael
2016
70-71 C p. 110-123
14 p.
artikel
210 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
211 Orthogonal graph drawing with inflexible edges Bläsius, Thomas
2016
70-71 C p. 26-40
15 p.
artikel
212 Orthogonal layout with optimal face complexity Alam, Md. Jawaherul
2017
70-71 C p. 40-52
13 p.
artikel
213 Output sensitive algorithms for approximate incidences and their applications Aiger, Dror

70-71 C p.
artikel
214 Pachinko Akitaya, Hugo A.
2018
70-71 C p. 226-242
artikel
215 Packing boundary-anchored rectangles and squares Biedl, Therese

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

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

70-71 C p.
artikel
219 Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons Eder, Günther
2018
70-71 C p. 15-23
artikel
220 Partially walking a polygon Aurenhammer, Franz
2019
70-71 C p. 3-11
artikel
221 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
222 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
223 Plane hop spanners for unit disk graphs: Simpler and better Biniaz, Ahmad

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

70-71 C p.
artikel
227 Preface Ellen, Faith

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

70-71 C p.
artikel
230 Progressive simplification of polygonal curves Buchin, Kevin

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

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

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

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

70-71 C p.
artikel
240 Self-approaching paths in simple polygons Bose, Prosenjit

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

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

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

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

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

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

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

70-71 C p.
artikel
262 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
263 The VC-dimension of visibility on the boundary of monotone polygons Gibson, Matt
2019
70-71 C p. 62-72
artikel
264 Thickness and colorability of geometric graphs Durocher, Stephane
2016
70-71 C p. 1-18
18 p.
artikel
265 Thread-parallel mesh improvement using face and edge swapping and vertex insertion Zangeneh, Reza
2018
70-71 C p. 31-48
artikel
266 Tight bounds for beacon-based coverage in simple rectilinear polygons Bae, Sang Won
2019
70-71 C p. 40-52
artikel
267 Tight bounds for conflict-free chromatic guarding of orthogonal art galleries Hoffmann, Frank
2018
70-71 C p. 24-34
artikel
268 Tighter estimates for ϵ-nets for disks Bus, Norbert
2016
70-71 C p. 27-35
9 p.
artikel
269 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
270 Time–space trade-offs for triangulations and Voronoi diagrams Korman, Matias
2018
70-71 C p. 35-45
artikel
271 Topological inference of manifolds with boundary Wang, Yuan

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

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

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

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

70-71 C p.
artikel
279 Visibility graphs, dismantlability, and the cops and robbers game Lubiw, Anna
2017
70-71 C p. 14-27
artikel
280 Visibility representations of boxes in 2.5 dimensions Arleo, Alessio
2018
70-71 C p. 19-33
artikel
281 (Weakly) Self-approaching geometric graphs and spanners Bakhshesh, Davood
2019
70-71 C p. 20-36
artikel
                             281 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland