|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
108 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A computational basis for higher-dimensional computational geometry and applications |
Mehlhorn, K. |
1998 |
124-125 | 4 |
p. 289-303 15 p. |
artikel |
|
| 2 | A deterministic algorithm for the three-dimensional diameter problem |
Matoušek, Jiří |
1996 |
124-125 | 4 |
p. 253-262 10 p. |
artikel |
|
| 3 | A framework for 1-D compaction with forbidden region avoidance |
Hambrusch, Susanne |
1992 |
124-125 | 4 |
p. 203-226 24 p. |
artikel |
|
| 4 | A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem |
Jaromczyk, Jerzy W. |
1999 |
124-125 | 4 |
p. 187-196 10 p. |
artikel |
|
| 5 | A kinetic triangulation scheme for moving points in the plane |
Kaplan, Haim |
2011 |
124-125 | 4 |
p. 191-205 15 p. |
artikel |
|
| 6 | A Kuratowski-type theorem for planarity of partially embedded graphs |
Jelínek, Vít |
2013 |
124-125 | 4 |
p. 466-492 27 p. |
artikel |
|
| 7 | A linear-space algorithm for distance preserving graph embedding |
Asano, Tetsuo |
2009 |
124-125 | 4 |
p. 289-304 16 p. |
artikel |
|
| 8 | A linear-time construction of the relative neighborhood graph from the Delaunay triangulation |
Lingas, Andrzej |
1994 |
124-125 | 4 |
p. 199-208 10 p. |
artikel |
|
| 9 | A near linear time approximation scheme for Steiner tree among obstacles in the plane |
Müller-Hannemann, Matthias |
2010 |
124-125 | 4 |
p. 395-409 15 p. |
artikel |
|
| 10 | Angle-Restricted Tours in the plane |
Fekete, Sándor P. |
1997 |
124-125 | 4 |
p. 195-218 24 p. |
artikel |
|
| 11 | An optimal algorithm for roundness determination on convex polygons |
Swanson, Kurt |
1995 |
124-125 | 4 |
p. 225-235 11 p. |
artikel |
|
| 12 | A note on optimal area algorithms for upward drawings of binary trees |
Crescenzi, P. |
1992 |
124-125 | 4 |
p. 187-200 14 p. |
artikel |
|
| 13 | An output-sensitive algorithm for persistent homology |
Chen, Chao |
2013 |
124-125 | 4 |
p. 435-447 13 p. |
artikel |
|
| 14 | A perturbation scheme for spherical arrangements with application to molecular modeling |
Halperin, Dan |
1998 |
124-125 | 4 |
p. 273-287 15 p. |
artikel |
|
| 15 | Approximate range searching: The absolute model |
da Fonseca, Guilherme D. |
2010 |
124-125 | 4 |
p. 434-444 11 p. |
artikel |
|
| 16 | Approximation algorithms for free-label maximization |
de Berg, Mark |
2012 |
124-125 | 4 |
p. 153-168 16 p. |
artikel |
|
| 17 | Area-efficient algorithms for straight-line tree drawings |
Shin, Chan-Su |
2000 |
124-125 | 4 |
p. 175-202 28 p. |
artikel |
|
| 18 | A simple, faster method for kinetic proximity problems |
Rahmati, Zahed |
2015 |
124-125 | 4 |
p. 342-359 18 p. |
artikel |
|
| 19 | Author index of Volume 10 (1998) |
1998 |
124-125 | 4 |
p. 319-320 2 p. |
artikel |
||
| 20 | Author index of Volume 9 (1998) |
1998 |
124-125 | 4 |
p. 289-290 2 p. |
artikel |
||
| 21 | Author index of Volume 14 (1999) |
1999 |
124-125 | 4 |
p. 275-276 2 p. |
artikel |
||
| 22 | Balanced partitions of two sets of points in the plane |
Kaneko, Atsushi |
1999 |
124-125 | 4 |
p. 253-261 9 p. |
artikel |
|
| 23 | CGTA-Awards 2011 |
Mehlhorn, Kurt |
2012 |
124-125 | 4 |
p. 139- 1 p. |
artikel |
|
| 24 | Characterization of contour elements that generate abstract Voronoi diagrams |
Stifter, Sabine |
1997 |
124-125 | 4 |
p. 245-262 18 p. |
artikel |
|
| 25 | Characterizing and recognizing weak visibility polygons |
Ghosh, Subir Kumar |
1993 |
124-125 | 4 |
p. 213-233 21 p. |
artikel |
|
| 26 | Combinatorial aspects of geometric graphs |
Teng, Shang-Hua |
1998 |
124-125 | 4 |
p. 277-287 11 p. |
artikel |
|
| 27 | Combinatorial complexity of signed discs |
Souvaine, Diane L. |
1995 |
124-125 | 4 |
p. 207-223 17 p. |
artikel |
|
| 28 | Combinatorial face enumeration in convex polytopes |
Fukuda, Komei |
1994 |
124-125 | 4 |
p. 191-198 8 p. |
artikel |
|
| 29 | Competing output-sensitive frame algorithms |
Dulá, J.H. |
2012 |
124-125 | 4 |
p. 186-197 12 p. |
artikel |
|
| 30 | Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design |
Majhi, Jayanth |
1999 |
124-125 | 4 |
p. 229-252 24 p. |
artikel |
|
| 31 | Computing depth orders for fat objects and related problems |
Agarwal, Pankaj K. |
1995 |
124-125 | 4 |
p. 187-206 20 p. |
artikel |
|
| 32 | Computing fence designs for orienting parts |
Berretty, Robert-Paul |
1998 |
124-125 | 4 |
p. 249-262 14 p. |
artikel |
|
| 33 | Computing simple paths among obstacles |
Cheng, Qi |
2000 |
124-125 | 4 |
p. 223-233 11 p. |
artikel |
|
| 34 | Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time |
Zhu, Binhai |
1997 |
124-125 | 4 |
p. 181-193 13 p. |
artikel |
|
| 35 | Computing the visibility map of fat objects |
de Berg, Mark |
2010 |
124-125 | 4 |
p. 410-418 9 p. |
artikel |
|
| 36 | Converting triangulations to quadrangulations |
Ramaswami, Suneeta |
1998 |
124-125 | 4 |
p. 257-276 20 p. |
artikel |
|
| 37 | Convex hull of points lying on lines in o ( n log n ) time after preprocessing |
Ezra, Esther |
2013 |
124-125 | 4 |
p. 417-434 18 p. |
artikel |
|
| 38 | Curve reconstruction: Connecting dots with good reason |
Dey, Tamal K. |
2000 |
124-125 | 4 |
p. 229-244 16 p. |
artikel |
|
| 39 | Depth of segments and circles through points enclosing many points: a note |
Ramos, Pedro A. |
2009 |
124-125 | 4 |
p. 338-341 4 p. |
artikel |
|
| 40 | Discrete rectilinear 2-center problems |
Katz, Matthew J. |
2000 |
124-125 | 4 |
p. 203-214 12 p. |
artikel |
|
| 41 | Dynamic data structures for fat objects and their applications |
Efrat, Alon |
2000 |
124-125 | 4 |
p. 215-227 13 p. |
artikel |
|
| 42 | Editorial |
Zeh, Norbert |
2010 |
124-125 | 4 |
p. 329-330 2 p. |
artikel |
|
| 43 | Editorial Board |
2009 |
124-125 | 4 |
p. IFC- 1 p. |
artikel |
||
| 44 | Efficient hidden surface removal for objects with small union size |
Katz, Matthew J. |
1992 |
124-125 | 4 |
p. 223-234 12 p. |
artikel |
|
| 45 | Erdős distance problems in normed spaces |
Brass, Peter |
1996 |
124-125 | 4 |
p. 195-214 20 p. |
artikel |
|
| 46 | Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep |
Chiang, Yi-Jen |
1998 |
124-125 | 4 |
p. 211-236 26 p. |
artikel |
|
| 47 | Farthest neighbors, maximum spanning trees and related problems in higher dimensions |
Agarwal, Pankaj K. |
1992 |
124-125 | 4 |
p. 189-201 13 p. |
artikel |
|
| 48 | Farthest-polygon Voronoi diagrams |
Cheong, Otfried |
2011 |
124-125 | 4 |
p. 234-247 14 p. |
artikel |
|
| 49 | Fast randomized parallel methods for planar convex hull construction |
Ghouse, Mujtaba R. |
1997 |
124-125 | 4 |
p. 219-235 17 p. |
artikel |
|
| 50 | Foreword |
Hoffmann, Christoph M. |
1998 |
124-125 | 4 |
p. 221- 1 p. |
artikel |
|
| 51 | Four results on randomized incremental constructions |
Clarkson, Kenneth L. |
1993 |
124-125 | 4 |
p. 185-212 28 p. |
artikel |
|
| 52 | Geometric dilation of closed curves in normed planes |
Martini, Horst |
2009 |
124-125 | 4 |
p. 315-321 7 p. |
artikel |
|
| 53 | Graphs that admit right angle crossing drawings |
Arikushi, Karin |
2012 |
124-125 | 4 |
p. 169-177 9 p. |
artikel |
|
| 54 | Guaranteed quality tetrahedral Delaunay meshing for medical images |
Foteinos, Panagiotis A. |
2014 |
124-125 | 4 |
p. 539-562 24 p. |
artikel |
|
| 55 | Guest Editorsʼ foreword |
Hurtado, Ferran |
2013 |
124-125 | 4 |
p. 401- 1 p. |
artikel |
|
| 56 | Index |
1999 |
124-125 | 4 |
p. 263-264 2 p. |
artikel |
||
| 57 | Index |
2000 |
124-125 | 4 |
p. 257-258 2 p. |
artikel |
||
| 58 | Index |
2000 |
124-125 | 4 |
p. 245-246 2 p. |
artikel |
||
| 59 | K-vertex guarding simple polygons |
Salleh, Ihsan |
2009 |
124-125 | 4 |
p. 352-361 10 p. |
artikel |
|
| 60 | Largest bounding box, smallest diameter, and related problems on imprecise points |
Löffler, Maarten |
2010 |
124-125 | 4 |
p. 419-433 15 p. |
artikel |
|
| 61 | Local, smooth, and consistent Jacobi set simplification |
Bhatia, Harsh |
2015 |
124-125 | 4 |
p. 311-332 22 p. |
artikel |
|
| 62 | Lower bounds on the number of crossing-free subgraphs of K N |
Garcı́a, Alfredo |
2000 |
124-125 | 4 |
p. 211-221 11 p. |
artikel |
|
| 63 | Master index of Volumes 1–10 |
1998 |
124-125 | 4 |
p. 321-332 12 p. |
artikel |
||
| 64 | Memoryless routing in convex subdivisions: Random walks are optimal |
Chen, Dan |
2012 |
124-125 | 4 |
p. 178-185 8 p. |
artikel |
|
| 65 | Minimum planar sets with maximum equidistance counts |
Erdős, Paul |
1997 |
124-125 | 4 |
p. 207-218 12 p. |
artikel |
|
| 66 | Model-based probing strategies for convex polygons |
Joseph, Eugene |
1992 |
124-125 | 4 |
p. 209-221 13 p. |
artikel |
|
| 67 | Moldable and castable polygons |
Rappaport, David |
1994 |
124-125 | 4 |
p. 219-233 15 p. |
artikel |
|
| 68 | Non-interactive geometric probing: Reconstructing non-convex polygons |
Hunter, Kevin D. |
1999 |
124-125 | 4 |
p. 221-240 20 p. |
artikel |
|
| 69 | Obituary Paul Erdős (1913–1996) |
Sack, Jörg-Rüdiger |
1997 |
124-125 | 4 |
p. 205-206 2 p. |
artikel |
|
| 70 | On a class of O ( n 2 ) problems in computational geometry |
Gajentaan, Anka |
2012 |
124-125 | 4 |
p. 140-152 13 p. |
artikel |
|
| 71 | On crossing numbers of geometric proximity graphs |
Ábrego, Bernardo M. |
2011 |
124-125 | 4 |
p. 216-233 18 p. |
artikel |
|
| 72 | On determining the congruence of point sets in d dimensions |
Akutsu, Tatsuya |
1998 |
124-125 | 4 |
p. 247-256 10 p. |
artikel |
|
| 73 | On Euclidean vehicle routing with allocation |
Remy, Jan |
2010 |
124-125 | 4 |
p. 357-376 20 p. |
artikel |
|
| 74 | On fat partitioning, fat covering and the union size of polygons |
van Kreveld, Marc |
1998 |
124-125 | 4 |
p. 197-210 14 p. |
artikel |
|
| 75 | On intersecting a point set with Euclidean balls |
Naiman, Daniel Q. |
1997 |
124-125 | 4 |
p. 237-244 8 p. |
artikel |
|
| 76 | On stabbling lines for convex polyhedra in 3D |
Agarwal, Pankaj K. |
1994 |
124-125 | 4 |
p. 177-189 13 p. |
artikel |
|
| 77 | On the union of κ-curved objects |
Efrat, Alon |
1999 |
124-125 | 4 |
p. 241-254 14 p. |
artikel |
|
| 78 | On the zone of the boundary of a convex body |
Raz, Orit E. |
2015 |
124-125 | 4 |
p. 333-341 9 p. |
artikel |
|
| 79 | Optimization for first order Delaunay triangulations |
van Kreveld, Marc |
2010 |
124-125 | 4 |
p. 377-394 18 p. |
artikel |
|
| 80 | Orthogonal equipartitions |
Bereg, Sergey |
2009 |
124-125 | 4 |
p. 305-314 10 p. |
artikel |
|
| 81 | Orthogonal range searching in linear and almost-linear space |
Nekrich, Yakov |
2009 |
124-125 | 4 |
p. 342-351 10 p. |
artikel |
|
| 82 | Planar segment visibility graphs |
Everett, H. |
2000 |
124-125 | 4 |
p. 235-243 9 p. |
artikel |
|
| 83 | Practical segment intersection with finite precision output |
Hobby, John D. |
1999 |
124-125 | 4 |
p. 199-214 16 p. |
artikel |
|
| 84 | RAPID: Randomized pharmacophore identification for drug design |
Finn, P.W. |
1998 |
124-125 | 4 |
p. 263-272 10 p. |
artikel |
|
| 85 | Recognizing polygonal parts from width measurements |
Arkin, Esther M. |
1998 |
124-125 | 4 |
p. 237-246 10 p. |
artikel |
|
| 86 | Relay placement for fault tolerance in wireless networks in higher dimensions |
Kashyap, Abhishek |
2011 |
124-125 | 4 |
p. 206-215 10 p. |
artikel |
|
| 87 | Reporting curve segment intersections using restricted predicates |
Chan, Timothy M. |
2000 |
124-125 | 4 |
p. 245-256 12 p. |
artikel |
|
| 88 | Rotational polygon overlap minimization and compaction |
Milenkovic, Victor J. |
1998 |
124-125 | 4 |
p. 305-318 14 p. |
artikel |
|
| 89 | r-regular shape reconstruction from unorganized points |
Attali, D. |
1998 |
124-125 | 4 |
p. 239-247 9 p. |
artikel |
|
| 90 | Saturated simple and k-simple topological graphs |
Kynčl, Jan |
2015 |
124-125 | 4 |
p. 295-310 16 p. |
artikel |
|
| 91 | Shortest paths in intersection graphs of unit disks |
Cabello, Sergio |
2015 |
124-125 | 4 |
p. 360-367 8 p. |
artikel |
|
| 92 | SOKOBAN and other motion planning problems |
Dor, Dorit |
1999 |
124-125 | 4 |
p. 215-228 14 p. |
artikel |
|
| 93 | Stabbing isothetic boxes and rectangles in O(n log n) time |
Hohmeyer, Michael E. |
1992 |
124-125 | 4 |
p. 201-207 7 p. |
artikel |
|
| 94 | Stable snap rounding |
Hershberger, John |
2013 |
124-125 | 4 |
p. 403-416 14 p. |
artikel |
|
| 95 | Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection |
Mehlhorn, K. |
1993 |
124-125 | 4 |
p. 235-246 12 p. |
artikel |
|
| 96 | The complexity of flow on fat terrains and its i/o-efficient computation |
de Berg, Mark |
2010 |
124-125 | 4 |
p. 331-356 26 p. |
artikel |
|
| 97 | The exact fitting problem in higher dimensions |
Guibas, Leonidas J. |
1996 |
124-125 | 4 |
p. 215-230 16 p. |
artikel |
|
| 98 | The greedy triangulation can be computed from the Delaunay triangulation in linear time |
Levcopoulos, Christos |
1999 |
124-125 | 4 |
p. 197-220 24 p. |
artikel |
|
| 99 | The γ-neighborhood graph |
Veltkamp, Remco C. |
1992 |
124-125 | 4 |
p. 227-246 20 p. |
artikel |
|
| 100 | Towards a definition of higher order constrained Delaunay triangulations |
Silveira, Rodrigo I. |
2009 |
124-125 | 4 |
p. 322-337 16 p. |
artikel |
|
| 101 | Translating a convex polygon to contain a maximum number of points |
Barequet, Gill |
1997 |
124-125 | 4 |
p. 167-179 13 p. |
artikel |
|
| 102 | Translational packing of arbitrary polytopes |
Egeblad, Jens |
2009 |
124-125 | 4 |
p. 269-288 20 p. |
artikel |
|
| 103 | Two segment classes with Hamiltonian visibility graphs |
O'Rourke, Joseph |
1994 |
124-125 | 4 |
p. 209-218 10 p. |
artikel |
|
| 104 | Variants for the Hough transform for line detection |
Asano, Tetsuo |
1996 |
124-125 | 4 |
p. 231-252 22 p. |
artikel |
|
| 105 | Vietoris–Rips complexes also provide topologically correct reconstructions of sampled shapes |
Attali, Dominique |
2013 |
124-125 | 4 |
p. 448-465 18 p. |
artikel |
|
| 106 | Wall thickness control in layered manufacturing for surfaces with closed slices |
Allen, Seth |
1998 |
124-125 | 4 |
p. 223-238 16 p. |
artikel |
|
| 107 | Watchman routes for lines and line segments |
Dumitrescu, Adrian |
2014 |
124-125 | 4 |
p. 527-538 12 p. |
artikel |
|
| 108 | Wiring edge-disjoint layouts |
Kuchem, Ruth |
1999 |
124-125 | 4 |
p. 255-273 19 p. |
artikel |
108 gevonden resultaten