|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
244 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A better heuristic for orthogonal graph drawings |
Biedl, Therese |
1998 |
70-71 | 3 |
p. 159-180 22 p. |
artikel |
|
| 2 | A circle packing algorithm |
Collins, Charles R. |
2003 |
70-71 | 3 |
p. 233-256 24 p. |
artikel |
|
| 3 | A competitive analysis of algorithms for searching unknown scenes |
Kalyanasundaram, Bala |
1993 |
70-71 | 3 |
p. 139-155 17 p. |
artikel |
|
| 4 | A convex hull algorithm for discs, and applications |
Rappaport, David |
1992 |
70-71 | 3 |
p. 171-187 17 p. |
artikel |
|
| 5 | Adaptive sampling for geometric problems over data streams |
Hershberger, John |
2008 |
70-71 | 3 |
p. 191-208 18 p. |
artikel |
|
| 6 | A dense planar point set from iterated line intersections |
Ismailescu, Dan |
2004 |
70-71 | 3 |
p. 257-267 11 p. |
artikel |
|
| 7 | A fractional Helly theorem for boxes |
Bárány, I. |
2015 |
70-71 | 3 |
p. 221-224 4 p. |
artikel |
|
| 8 | A Helly-type theorem for higher-dimensional transversals |
Aronov, Boris |
2002 |
70-71 | 3 |
p. 177-183 7 p. |
artikel |
|
| 9 | Algorithms for optimal area triangulations of a convex polygon |
Keil, J. Mark |
2006 |
70-71 | 3 |
p. 173-187 15 p. |
artikel |
|
| 10 | Algorithms for the multiple label placement problem |
Kakoulis, Konstantinos G. |
2006 |
70-71 | 3 |
p. 143-161 19 p. |
artikel |
|
| 11 | A linear time algorithm to remove winding of a simple polygon |
Bhattacharya, Binay Kumar |
2006 |
70-71 | 3 |
p. 165-173 9 p. |
artikel |
|
| 12 | An approximation algorithm for cutting out convex polygons |
Dumitrescu, Adrian |
2004 |
70-71 | 3 |
p. 223-231 9 p. |
artikel |
|
| 13 | An efficient algorithm for enumeration of triangulations |
Bespamyatnikh, Sergei |
2002 |
70-71 | 3 |
p. 271-279 9 p. |
artikel |
|
| 14 | An efficient algorithm for the stratification and triangulation of an algebraic surface |
Berberich, Eric |
2010 |
70-71 | 3 |
p. 257-278 22 p. |
artikel |
|
| 15 | An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ☆ ☆ This research was supported in part by the National Science Foundation under grants CCR-9623585 and CCR-9988468. |
Chen, Danny Z. |
2001 |
70-71 | 3 |
p. 155-166 12 p. |
artikel |
|
| 16 | An elementary algorithm for reporting intersections of red/blue curve segments |
Boissonnat, Jean-Daniel |
2002 |
70-71 | 3 |
p. 167-175 9 p. |
artikel |
|
| 17 | A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets |
Klenk, Simone |
2006 |
70-71 | 3 |
p. 127-148 22 p. |
artikel |
|
| 18 | An intersection-sensitive algorithm for snap rounding |
de Berg, Mark |
2007 |
70-71 | 3 |
p. 159-165 7 p. |
artikel |
|
| 19 | An optimal algorithm for the rectilinear link center of a rectilinear polygon |
Nilsson, Bengt J. |
1996 |
70-71 | 3 |
p. 169-194 26 p. |
artikel |
|
| 20 | An optimal randomized algorithm for d-variate zonoid depth |
Morin, Pat |
2008 |
70-71 | 3 |
p. 229-235 7 p. |
artikel |
|
| 21 | A note on parallel algorithms for optimal h-v drawings of binary trees |
Metaxas, Panagiotis T. |
1998 |
70-71 | 3 |
p. 145-158 14 p. |
artikel |
|
| 22 | Approximate decision algorithms for point set congruence |
Heffernan, Paul J. |
1994 |
70-71 | 3 |
p. 137-156 20 p. |
artikel |
|
| 23 | Approximate distance oracles for graphs with dense clusters |
Andersson, Mattias |
2007 |
70-71 | 3 |
p. 142-154 13 p. |
artikel |
|
| 24 | Approximate range searching using binary space partitions |
de Berg, Mark |
2006 |
70-71 | 3 |
p. 139-151 13 p. |
artikel |
|
| 25 | Approximating geometric bottleneck shortest paths |
Bose, Prosenjit |
2004 |
70-71 | 3 |
p. 233-249 17 p. |
artikel |
|
| 26 | A quadratic distance bound on sliding between crossing-free spanning trees |
Aichholzer, Oswin |
2007 |
70-71 | 3 |
p. 155-161 7 p. |
artikel |
|
| 27 | A result about the density of iterated line intersections in the plane |
Hillar, Christopher J. |
2006 |
70-71 | 3 |
p. 106-114 9 p. |
artikel |
|
| 28 | Art galleries with guards of uniform range of vision |
Tóth, Cs.D. |
2002 |
70-71 | 3 |
p. 185-192 8 p. |
artikel |
|
| 29 | Art gallery theorems for guarded guards |
Michael, T.S. |
2003 |
70-71 | 3 |
p. 247-258 12 p. |
artikel |
|
| 30 | A sensor-based framework for kinetic data compression |
Friedler, Sorelle A. |
2015 |
70-71 | 3 |
p. 147-168 22 p. |
artikel |
|
| 31 | A simple and efficient kinetic spanner |
Abam, Mohammad Ali |
2010 |
70-71 | 3 |
p. 251-256 6 p. |
artikel |
|
| 32 | A simple linear algorithm for computing rectilinear 3-centers |
Hoffmann, Michael |
2005 |
70-71 | 3 |
p. 150-165 16 p. |
artikel |
|
| 33 | A (slightly) faster algorithm for Klee's measure problem |
Chan, Timothy M. |
2010 |
70-71 | 3 |
p. 243-250 8 p. |
artikel |
|
| 34 | A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio |
Rusu, Adrian |
2015 |
70-71 | 3 |
p. 268-294 27 p. |
artikel |
|
| 35 | Augmenting the connectivity of geometric graphs |
Abellanas, M. |
2008 |
70-71 | 3 |
p. 220-230 11 p. |
artikel |
|
| 36 | Author index of Volume 25 (2003) |
2003 |
70-71 | 3 |
p. 267-268 2 p. |
artikel |
||
| 37 | Author index of Volume 24 (2003) |
2003 |
70-71 | 3 |
p. 225-226 2 p. |
artikel |
||
| 38 | Author index of Volume 26 (2003) |
2003 |
70-71 | 3 |
p. 259-260 2 p. |
artikel |
||
| 39 | Author index of Volume 21 |
2002 |
70-71 | 3 |
p. 205-206 2 p. |
artikel |
||
| 40 | Author index of Volume 23 (2002) |
2002 |
70-71 | 3 |
p. 353-354 2 p. |
artikel |
||
| 41 | Author index of Volume 20 (2001) |
2001 |
70-71 | 3 |
p. 145-146 2 p. |
artikel |
||
| 42 | Author index of Volume 18 (2001) |
2001 |
70-71 | 3 |
p. 189- 1 p. |
artikel |
||
| 43 | Author index of Volume 33 |
2006 |
70-71 | 3 |
p. 186-187 2 p. |
artikel |
||
| 44 | Author index of Volume 35 |
2006 |
70-71 | 3 |
p. 226-227 2 p. |
artikel |
||
| 45 | Author index of Volume 34 |
2006 |
70-71 | 3 |
p. 203-204 2 p. |
artikel |
||
| 46 | Author index of Volume 32 |
2005 |
70-71 | 3 |
p. 238-239 2 p. |
artikel |
||
| 47 | Author index of Volume 31 |
2005 |
70-71 | 3 |
p. 263-264 2 p. |
artikel |
||
| 48 | Author index of Volume 30 |
2005 |
70-71 | 3 |
p. 279-280 2 p. |
artikel |
||
| 49 | Author index of Volume 27 |
2004 |
70-71 | 3 |
p. 269-270 2 p. |
artikel |
||
| 50 | Author index of Volume 29 |
2004 |
70-71 | 3 |
p. 265-266 2 p. |
artikel |
||
| 51 | Boundary labeling: Models and efficient algorithms for rectangular maps |
Bekos, Michael A. |
2007 |
70-71 | 3 |
p. 215-236 22 p. |
artikel |
|
| 52 | Capture bounds for visibility-based pursuit evasion |
Klein, Kyle |
2015 |
70-71 | 3 |
p. 205-220 16 p. |
artikel |
|
| 53 | Chromatic variants of the Erdős–Szekeres theorem on points in convex position |
Devillers, Olivier |
2003 |
70-71 | 3 |
p. 193-208 16 p. |
artikel |
|
| 54 | Combinatorial complexity of translating a box in polyhedral 3-space |
Halperin, Dan |
1998 |
70-71 | 3 |
p. 181-196 16 p. |
artikel |
|
| 55 | Compatible triangulations and point partitions by series-triangular graphs |
Danciger, Jeff |
2006 |
70-71 | 3 |
p. 195-202 8 p. |
artikel |
|
| 56 | Competitive on-line coverage of grid environments by a mobile robot |
Gabriely, Yoav |
2003 |
70-71 | 3 |
p. 197-224 28 p. |
artikel |
|
| 57 | Computational analysis of mesh simplification using global error |
Balmelli, Laurent |
2003 |
70-71 | 3 |
p. 171-196 26 p. |
artikel |
|
| 58 | Computing a minimum-dilation spanning tree is NP-hard |
Cheong, Otfried |
2008 |
70-71 | 3 |
p. 188-205 18 p. |
artikel |
|
| 59 | Computing grasp functions |
Rao, Anil S. |
1996 |
70-71 | 3 |
p. 145-168 24 p. |
artikel |
|
| 60 | Computing homotopic shortest paths efficiently |
Efrat, Alon |
2006 |
70-71 | 3 |
p. 162-172 11 p. |
artikel |
|
| 61 | Computing the face lattice of a polytope from its vertex-facet incidences |
Kaibel, Volker |
2002 |
70-71 | 3 |
p. 281-290 10 p. |
artikel |
|
| 62 | Computing the Fréchet distance between piecewise smooth curves |
Rote, Günter |
2007 |
70-71 | 3 |
p. 162-174 13 p. |
artikel |
|
| 63 | Computing the smallest k-enclosing circle and related problems |
Efrat, Alon |
1994 |
70-71 | 3 |
p. 119-136 18 p. |
artikel |
|
| 64 | Computing Voronoi skeletons of a 3-D polyhedron by space subdivision |
Etzion, Michal |
2002 |
70-71 | 3 |
p. 87-120 34 p. |
artikel |
|
| 65 | Constrained higher order Delaunay triangulations |
Gudmundsson, Joachim |
2005 |
70-71 | 3 |
p. 271-277 7 p. |
artikel |
|
| 66 | Constructing minimum-interference networks |
Benkert, Marc |
2008 |
70-71 | 3 |
p. 179-194 16 p. |
artikel |
|
| 67 | Convexity recognition of the union of polyhedra |
Bemporad, Alberto |
2001 |
70-71 | 3 |
p. 141-154 14 p. |
artikel |
|
| 68 | Convex tours of bounded curvature |
Boissonnat, Jean-Daniel |
1999 |
70-71 | 3 |
p. 149-159 11 p. |
artikel |
|
| 69 | Cost prediction for ray shooting in octrees |
Aronov, Boris |
2006 |
70-71 | 3 |
p. 159-181 23 p. |
artikel |
|
| 70 | Counting and representing intersections among triangles in three dimensions |
Ezra, Esther |
2005 |
70-71 | 3 |
p. 196-215 20 p. |
artikel |
|
| 71 | Covering points by disjoint boxes with outliers |
Ahn, Hee-Kap |
2011 |
70-71 | 3 |
p. 178-190 13 p. |
artikel |
|
| 72 | Covering point sets with two disjoint disks or squares |
Cabello, Sergio |
2008 |
70-71 | 3 |
p. 195-206 12 p. |
artikel |
|
| 73 | Covering points with a polygon |
Barequet, Gill |
2008 |
70-71 | 3 |
p. 143-162 20 p. |
artikel |
|
| 74 | Curvature based shape detection |
Šukilović, Tijana |
2015 |
70-71 | 3 |
p. 180-188 9 p. |
artikel |
|
| 75 | Delaunay triangulation of imprecise points in linear time after preprocessing |
Löffler, Maarten |
2010 |
70-71 | 3 |
p. 234-242 9 p. |
artikel |
|
| 76 | Densest lattice packings of 3-polytopes |
Betke, Ulrich |
2000 |
70-71 | 3 |
p. 157-186 30 p. |
artikel |
|
| 77 | 3D Euler spirals for 3D curve completion |
Harary, Gur |
2012 |
70-71 | 3 |
p. 115-126 12 p. |
artikel |
|
| 78 | Distance-preserving approximations of polygonal paths |
Gudmundsson, Joachim |
2007 |
70-71 | 3 |
p. 183-196 14 p. |
artikel |
|
| 79 | Drawing outerplanar graphs using three edge lengths |
Alon, Noga |
2015 |
70-71 | 3 |
p. 260-267 8 p. |
artikel |
|
| 80 | Drawings of planar graphs with few slopes and segments |
Dujmović, Vida |
2007 |
70-71 | 3 |
p. 194-212 19 p. |
artikel |
|
| 81 | Dynamic output-sensitive hidden surface removal for c-oriented polyhedra |
de Berg, Mark |
1992 |
70-71 | 3 |
p. 119-140 22 p. |
artikel |
|
| 82 | Edge guarding polyhedral terrains |
Everett, Hazel |
1997 |
70-71 | 3 |
p. 201-203 3 p. |
artikel |
|
| 83 | Editorial |
Sack, Jörg-Rüdiger |
1998 |
70-71 | 3 |
p. 127- 1 p. |
artikel |
|
| 84 | Editorial |
Snoeyink, Jack |
2005 |
70-71 | 3 |
p. 149- 1 p. |
artikel |
|
| 85 | Editorial |
Cortes, Carmen |
2007 |
70-71 | 3 |
p. 141- 1 p. |
artikel |
|
| 86 | Editorial Board |
2009 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 87 | Editorial Board |
2006 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 88 | Editorial Board |
2006 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 89 | Editorial Board |
2006 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 90 | Editorial Board |
2005 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 91 | Editorial Board |
2007 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 92 | Editorial Board |
2007 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 93 | Editorial Board |
2007 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 94 | Editorial Board |
2008 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 95 | Editorial Board |
2008 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 96 | Editorial Board |
2008 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 97 | Editors |
2002 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 98 | Editors |
2003 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 99 | Editors |
2003 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 100 | Editors |
2003 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 101 | Editors |
2005 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 102 | Editors |
2005 |
70-71 | 3 |
p. CO2- 1 p. |
artikel |
||
| 103 | Editors |
2004 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 104 | Editors |
2004 |
70-71 | 3 |
p. IFC- 1 p. |
artikel |
||
| 105 | Efficient c-oriented range searching with DOP-trees |
de Berg, Mark |
2009 |
70-71 | 3 |
p. 250-267 18 p. |
artikel |
|
| 106 | Efficient visibility queries in simple polygons |
Bose, Prosenjit |
2002 |
70-71 | 3 |
p. 313-335 23 p. |
artikel |
|
| 107 | Empty region graphs |
Cardinal, Jean |
2009 |
70-71 | 3 |
p. 183-195 13 p. |
artikel |
|
| 108 | Enumerating pseudo-triangulations in the plane |
Bereg, Sergey |
2005 |
70-71 | 3 |
p. 207-222 16 p. |
artikel |
|
| 109 | Erased arrangements of lines and convex decompositions of polyhedra |
Hershberger, J.E. |
1998 |
70-71 | 3 |
p. 129-143 15 p. |
artikel |
|
| 110 | Extremal point queries with lines and line segments and related problems |
Daescu, Ovidiu |
2005 |
70-71 | 3 |
p. 223-237 15 p. |
artikel |
|
| 111 | Farthest-point queries with geometric and combinatorial constraints |
Daescu, Ovidiu |
2006 |
70-71 | 3 |
p. 174-185 12 p. |
artikel |
|
| 112 | Fast approximations for sums of distances, clustering and the Fermat–Weber problem |
Bose, Prosenjit |
2003 |
70-71 | 3 |
p. 135-146 12 p. |
artikel |
|
| 113 | Fast reconstruction of Delaunay triangulations |
Sohler, Christian |
2005 |
70-71 | 3 |
p. 166-178 13 p. |
artikel |
|
| 114 | Finding a shortest diagonal of a simple polygon in linear time |
Hershberger, John |
1997 |
70-71 | 3 |
p. 149-160 12 p. |
artikel |
|
| 115 | Fitting a two-joint orthogonal chain to a point set |
Díaz-Báñez, J.M. |
2011 |
70-71 | 3 |
p. 135-147 13 p. |
artikel |
|
| 116 | Foreword |
Teillaud, Monique |
2010 |
70-71 | 3 |
p. 233- 1 p. |
artikel |
|
| 117 | Geometric dilation of closed planar curves: New lower bounds |
Ebbers-Baumann, Annette |
2007 |
70-71 | 3 |
p. 188-208 21 p. |
artikel |
|
| 118 | Geometric permutations of disjoint unit spheres |
Cheong, Otfried |
2005 |
70-71 | 3 |
p. 253-270 18 p. |
artikel |
|
| 119 | Geometric spanners with applications in wireless networks |
Schindelhauer, Christian |
2007 |
70-71 | 3 |
p. 197-214 18 p. |
artikel |
|
| 120 | Getting around a lower bound for the minimum Hausdorff distance |
Chew, L.Paul |
1998 |
70-71 | 3 |
p. 197-202 6 p. |
artikel |
|
| 121 | Graph drawings with few slopes |
Dujmović, Vida |
2007 |
70-71 | 3 |
p. 181-193 13 p. |
artikel |
|
| 122 | Graph of triangulations of a convex polygon and tree of triangulations |
Hurtado, F. |
1999 |
70-71 | 3 |
p. 179-188 10 p. |
artikel |
|
| 123 | Guarding polyhedral terrains |
Bose, Prosenjit |
1997 |
70-71 | 3 |
p. 173-185 13 p. |
artikel |
|
| 124 | Hinged dissection of polyominoes and polyforms |
Demaine, Erik D. |
2005 |
70-71 | 3 |
p. 237-262 26 p. |
artikel |
|
| 125 | Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time |
Chambers, Erin Wolf |
2010 |
70-71 | 3 |
p. 295-311 17 p. |
artikel |
|
| 126 | Illumination complexes, Δ-zonotopes, and the polyhedral curtain theorem |
Živaljević, Rade T. |
2015 |
70-71 | 3 |
p. 225-236 12 p. |
artikel |
|
| 127 | Illumination in the presence of opaque line segments in the plane |
Tóth, Csaba D. |
2002 |
70-71 | 3 |
p. 193-204 12 p. |
artikel |
|
| 128 | Improved data structures for the orthogonal range successor problem |
Yu, Chih-Chiang |
2011 |
70-71 | 3 |
p. 148-159 12 p. |
artikel |
|
| 129 | Improved upper bounds on the reflexivity of point sets |
Ackerman, Eyal |
2009 |
70-71 | 3 |
p. 241-249 9 p. |
artikel |
|
| 130 | Improving the topology computation of an arrangement of cubics |
Caravantes, Jorge |
2008 |
70-71 | 3 |
p. 206-218 13 p. |
artikel |
|
| 131 | Inapproximability of finding maximum hidden sets on polygons and terrains |
Eidenbenz, Stephan |
2002 |
70-71 | 3 |
p. 139-153 15 p. |
artikel |
|
| 132 | Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets |
Ahn, Hee-Kap |
2006 |
70-71 | 3 |
p. 152-164 13 p. |
artikel |
|
| 133 | Intersections with random geometric objects |
Bose, Prosenjit |
1998 |
70-71 | 3 |
p. 139-154 16 p. |
artikel |
|
| 134 | I/O-efficient algorithms for computing planar geometric spanners |
Maheshwari, Anil |
2008 |
70-71 | 3 |
p. 252-271 20 p. |
artikel |
|
| 135 | Iterated snap rounding with bounded drift |
Packer, Eli |
2008 |
70-71 | 3 |
p. 231-251 21 p. |
artikel |
|
| 136 | Kinetic collision detection between two simple polygons |
Basch, Julien |
2004 |
70-71 | 3 |
p. 211-235 25 p. |
artikel |
|
| 137 | Linear time algorithm for optimal feed-link placement |
Savić, Marko |
2015 |
70-71 | 3 |
p. 189-204 16 p. |
artikel |
|
| 138 | Linear-time algorithms for weakly-monotone polygons |
Heffernan, Paul J. |
1993 |
70-71 | 3 |
p. 121-137 17 p. |
artikel |
|
| 139 | Linear time approximation of 3D convex polytopes |
Lopez, Mario A. |
2002 |
70-71 | 3 |
p. 291-301 11 p. |
artikel |
|
| 140 | Line-segment intersection made in-place |
Vahrenhold, Jan |
2007 |
70-71 | 3 |
p. 213-230 18 p. |
artikel |
|
| 141 | Linkless symmetric drawings of series parallel digraphs |
Hong, Seok-Hee |
2004 |
70-71 | 3 |
p. 191-221 31 p. |
artikel |
|
| 142 | Localized homology |
Zomorodian, Afra |
2008 |
70-71 | 3 |
p. 126-148 23 p. |
artikel |
|
| 143 | Master index of Volumes 11–20 |
2001 |
70-71 | 3 |
p. 147-154 8 p. |
artikel |
||
| 144 | Master index of Volumes 21–30 |
2005 |
70-71 | 3 |
p. 281-291 11 p. |
artikel |
||
| 145 | Maximizing the guarded boundary of an Art Gallery is APX-complete |
Fragoudakis, Christodoulos |
2007 |
70-71 | 3 |
p. 170-180 11 p. |
artikel |
|
| 146 | Maximum thick paths in static and dynamic environments |
Arkin, Esther M. |
2010 |
70-71 | 3 |
p. 279-294 16 p. |
artikel |
|
| 147 | Maximum upward planar subgraphs of embedded planar digraphs |
Binucci, Carla |
2008 |
70-71 | 3 |
p. 230-246 17 p. |
artikel |
|
| 148 | Median problem in some plane triangulations and quadrangulations |
Chepoi, Victor |
2004 |
70-71 | 3 |
p. 193-210 18 p. |
artikel |
|
| 149 | Meshing skin surfaces with certified topology |
Kruithof, N.G.H. |
2007 |
70-71 | 3 |
p. 166-182 17 p. |
artikel |
|
| 150 | Minimal enclosing parallelepiped in 3D |
Vivien, Frédéric |
2004 |
70-71 | 3 |
p. 177-190 14 p. |
artikel |
|
| 151 | Minimum weight pseudo-triangulations |
Gudmundsson, Joachim |
2007 |
70-71 | 3 |
p. 139-153 15 p. |
artikel |
|
| 152 | Monotone paths in line arrangements |
Radoičić, Radoš |
2003 |
70-71 | 3 |
p. 129-134 6 p. |
artikel |
|
| 153 | More planar two-center algorithms |
Chan, Timothy M. |
1999 |
70-71 | 3 |
p. 189-198 10 p. |
artikel |
|
| 154 | Non-stretchable pseudo-visibility graphs |
Streinu, Ileana |
2005 |
70-71 | 3 |
p. 195-206 12 p. |
artikel |
|
| 155 | Octagonal drawings of plane graphs with prescribed face areas |
Rahman, Md. Saidur |
2009 |
70-71 | 3 |
p. 214-230 17 p. |
artikel |
|
| 156 | Octrees with near optimal cost for ray-shooting |
Brönnimann, Hervé |
2006 |
70-71 | 3 |
p. 182-194 13 p. |
artikel |
|
| 157 | On a class of O(n 2) problems in computational geometry |
Gajentaan, Anka |
1995 |
70-71 | 3 |
p. 165-185 21 p. |
artikel |
|
| 158 | On a cone covering problem |
Elbassioni, Khaled |
2011 |
70-71 | 3 |
p. 129-134 6 p. |
artikel |
|
| 159 | On balanced 4-holes in bichromatic point sets |
Bereg, S. |
2015 |
70-71 | 3 |
p. 169-179 11 p. |
artikel |
|
| 160 | On embedding an outer-planar graph in a point set |
Bose, Prosenjit |
2002 |
70-71 | 3 |
p. 303-312 10 p. |
artikel |
|
| 161 | On finding widest empty curved corridors |
Bereg, Sergey |
2007 |
70-71 | 3 |
p. 154-169 16 p. |
artikel |
|
| 162 | On guarding the vertices of rectilinear domains |
Katz, Matthew J. |
2008 |
70-71 | 3 |
p. 219-228 10 p. |
artikel |
|
| 163 | On incremental rendering of silhouette maps of a polyhedral scene |
Efrat, Alon |
2007 |
70-71 | 3 |
p. 129-138 10 p. |
artikel |
|
| 164 | On k-convex polygons |
Aichholzer, Oswin |
2012 |
70-71 | 3 |
p. 73-87 15 p. |
artikel |
|
| 165 | On rectangular cartograms |
van Kreveld, Marc |
2007 |
70-71 | 3 |
p. 175-187 13 p. |
artikel |
|
| 166 | On representations of some thickness-two graphs |
Hutchinson, Joan P. |
1999 |
70-71 | 3 |
p. 161-171 11 p. |
artikel |
|
| 167 | On R-trees with low query complexity |
de Berg, M. |
2003 |
70-71 | 3 |
p. 179-195 17 p. |
artikel |
|
| 168 | On the approximation of a smooth surface with a triangulated mesh |
Morvan, J.M. |
2002 |
70-71 | 3 |
p. 337-352 16 p. |
artikel |
|
| 169 | On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes |
Golin, Mordecai J. |
2003 |
70-71 | 3 |
p. 197-231 35 p. |
artikel |
|
| 170 | On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees |
Das, Gautam |
1997 |
70-71 | 3 |
p. 123-137 15 p. |
artikel |
|
| 171 | On the difficulty of range searching |
Andersson, Arne |
1997 |
70-71 | 3 |
p. 115-122 8 p. |
artikel |
|
| 172 | On the distribution of order types |
Bokowski, Jürgen |
1992 |
70-71 | 3 |
p. 127-142 16 p. |
artikel |
|
| 173 | On the Fermat–Weber center of a convex object |
Carmi, Paz |
2005 |
70-71 | 3 |
p. 188-195 8 p. |
artikel |
|
| 174 | On the minimum total length of interval systems expressing all intervals, and range-restricted queries |
Ahn, Hee-Kap |
2009 |
70-71 | 3 |
p. 207-213 7 p. |
artikel |
|
| 175 | On the number of disjoint convex quadrilaterals for a planar point set |
Hosono, Kiyoshi |
2001 |
70-71 | 3 |
p. 97-104 8 p. |
artikel |
|
| 176 | On the sizes of Delaunay meshes |
Cheng, Siu-Wing |
2006 |
70-71 | 3 |
p. 130-138 9 p. |
artikel |
|
| 177 | On triangulating three-dimensional polygons |
Barequet, Gill |
1998 |
70-71 | 3 |
p. 155-170 16 p. |
artikel |
|
| 178 | Optimal discrete Morse functions for 2-manifolds |
Lewiner, Thomas |
2003 |
70-71 | 3 |
p. 221-233 13 p. |
artikel |
|
| 179 | Optimal location of transportation devices |
Cardinal, Jean |
2008 |
70-71 | 3 |
p. 219-229 11 p. |
artikel |
|
| 180 | Optimal, output-sensitive algorithms for constructing planar hulls in parallel |
Gupta, Neelima |
1997 |
70-71 | 3 |
p. 151-166 16 p. |
artikel |
|
| 181 | Optimizing active ranges for consistent dynamic map labeling |
Been, Ken |
2010 |
70-71 | 3 |
p. 312-328 17 p. |
artikel |
|
| 182 | Parallel algorithms on circular-arc graphs |
Andrews, Marilyn G. |
1995 |
70-71 | 3 |
p. 117-141 25 p. |
artikel |
|
| 183 | Parallel fractional cascading on hypercube multiprocessors |
Dehne, Frank |
1992 |
70-71 | 3 |
p. 141-167 27 p. |
artikel |
|
| 184 | Parallel searching in the plane |
Baeza-Yates, Ricardo |
1995 |
70-71 | 3 |
p. 143-154 12 p. |
artikel |
|
| 185 | Parallel searching on m rays ☆ ☆ This research is supported by the DFG-Project “Diskrete Probleme”, No. Ot 64/8-3. |
Hammar, Mikael |
2001 |
70-71 | 3 |
p. 125-139 15 p. |
artikel |
|
| 186 | Partitioning point sets in space into disjoint convex polytopes |
Urabe, Masatsugu |
1999 |
70-71 | 3 |
p. 173-178 6 p. |
artikel |
|
| 187 | Perturbations for Delaunay and weighted Delaunay 3D triangulations |
Devillers, Olivier |
2011 |
70-71 | 3 |
p. 160-168 9 p. |
artikel |
|
| 188 | Point location in zones of k-flats in arrangements |
de Berg, Mark |
1996 |
70-71 | 3 |
p. 131-143 13 p. |
artikel |
|
| 189 | Point-set embeddings of plane 3-trees |
Nishat, Rahnuma Islam |
2012 |
70-71 | 3 |
p. 88-98 11 p. |
artikel |
|
| 190 | Polygonal chains cannot lock in 4D |
Cocan, Roxana |
2001 |
70-71 | 3 |
p. 105-129 25 p. |
artikel |
|
| 191 | Polygonal path simplification with angle constraints |
Chen, Danny Z. |
2005 |
70-71 | 3 |
p. 173-187 15 p. |
artikel |
|
| 192 | Polynomial-time approximation schemes for piercing and covering with applications in wireless networks |
Carmi, Paz |
2008 |
70-71 | 3 |
p. 209-218 10 p. |
artikel |
|
| 193 | Preprocessing chains for fast dihedral rotations is hard or even impossible |
Soss, Michael |
2003 |
70-71 | 3 |
p. 235-246 12 p. |
artikel |
|
| 194 | Progress on maximum weight triangulation |
Qian, Jianbo |
2006 |
70-71 | 3 |
p. 99-105 7 p. |
artikel |
|
| 195 | Protecting critical facets in layered manufacturing |
Schwerdt, Jörg |
2000 |
70-71 | 3 |
p. 187-210 24 p. |
artikel |
|
| 196 | Proximity problems on line segments spanned by points |
Daescu, Ovidiu |
2006 |
70-71 | 3 |
p. 115-129 15 p. |
artikel |
|
| 197 | Quality mesh generation for molecular skin surfaces using restricted union of balls |
Cheng, Ho-Lun |
2009 |
70-71 | 3 |
p. 196-206 11 p. |
artikel |
|
| 198 | Randomized incremental construction of abstract Voronoi diagrams |
Klein, Rolf |
1993 |
70-71 | 3 |
p. 157-184 28 p. |
artikel |
|
| 199 | Ray shooting and stone throwing with near-linear storage |
Sharir, Micha |
2005 |
70-71 | 3 |
p. 239-252 14 p. |
artikel |
|
| 200 | Recognizing weakly convex visible polygons |
Biswas, Supriya |
1998 |
70-71 | 3 |
p. 171-186 16 p. |
artikel |
|
| 201 | Rectangular drawings of plane graphs without designated corners |
Rahman, Md.Saidur |
2002 |
70-71 | 3 |
p. 121-138 18 p. |
artikel |
|
| 202 | Rectangular grid drawings of plane graphs |
Rahman, Md.Saidur |
1998 |
70-71 | 3 |
p. 203-220 18 p. |
artikel |
|
| 203 | Region-restricted clustering for geographic data mining |
Gudmundsson, Joachim |
2009 |
70-71 | 3 |
p. 231-240 10 p. |
artikel |
|
| 204 | Reporting flock patterns |
Benkert, Marc |
2008 |
70-71 | 3 |
p. 111-125 15 p. |
artikel |
|
| 205 | Reporting points in halfspaces |
Matous̆ek, Jir̆í |
1992 |
70-71 | 3 |
p. 169-186 18 p. |
artikel |
|
| 206 | Rigid realizations of graphs on small grids |
Fekete, Zsolt |
2005 |
70-71 | 3 |
p. 216-222 7 p. |
artikel |
|
| 207 | Rotationally optimal spanning and Steiner trees in uniform orientation metrics |
Brazil, Marcus |
2004 |
70-71 | 3 |
p. 251-263 13 p. |
artikel |
|
| 208 | Routing multi-class traffic flows in the plane |
Kim, Joondong |
2012 |
70-71 | 3 |
p. 99-114 16 p. |
artikel |
|
| 209 | Schematization of networks |
Cabello, Sergio |
2005 |
70-71 | 3 |
p. 223-238 16 p. |
artikel |
|
| 210 | Sequential and parallel algorithms for finding a maximum convex polygon |
Fischer, Paul |
1997 |
70-71 | 3 |
p. 187-200 14 p. |
artikel |
|
| 211 | Space-efficient geometric divide-and-conquer algorithms |
Bose, Prosenjit |
2007 |
70-71 | 3 |
p. 209-227 19 p. |
artikel |
|
| 212 | Sparse geometric graphs with small dilation |
Aronov, Boris |
2008 |
70-71 | 3 |
p. 207-219 13 p. |
artikel |
|
| 213 | Spiderman graph: Visibility in urban regions |
Carmi, Paz |
2015 |
70-71 | 3 |
p. 251-259 9 p. |
artikel |
|
| 214 | Structural filtering: a paradigm for efficient and exact geometric programs |
Funke, Stefan |
2005 |
70-71 | 3 |
p. 179-194 16 p. |
artikel |
|
| 215 | Tangencies between families of disjoint regions in the plane |
Pach, János |
2012 |
70-71 | 3 |
p. 131-138 8 p. |
artikel |
|
| 216 | Testing geometric objects |
Romantik, Kathleen |
1994 |
70-71 | 3 |
p. 157-176 20 p. |
artikel |
|
| 217 | The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing |
Goldschmidt, Nir |
2008 |
70-71 | 3 |
p. 167-187 21 p. |
artikel |
|
| 218 | The common exterior of convex polygons in the plane |
Aronov, Boris |
1997 |
70-71 | 3 |
p. 139-149 11 p. |
artikel |
|
| 219 | The DFS-heuristic for orthogonal graph drawing ☆ ☆ Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference on Computational Geometry, Ottawa, 1996, see [1]. |
Biedl, Therese |
2001 |
70-71 | 3 |
p. 167-188 22 p. |
artikel |
|
| 220 | The Erdős–Nagy theorem and its ramifications |
Toussaint, Godfried |
2005 |
70-71 | 3 |
p. 219-236 18 p. |
artikel |
|
| 221 | The expected size of the sphere-of-influence graph |
Dwyer, Rex A. |
1995 |
70-71 | 3 |
p. 155-164 10 p. |
artikel |
|
| 222 | The farthest point Delaunay triangulation minimizes angles |
Eppstein, David |
1992 |
70-71 | 3 |
p. 143-148 6 p. |
artikel |
|
| 223 | The flow complex: A data structure for geometric modeling |
Giesen, Joachim |
2008 |
70-71 | 3 |
p. 178-190 13 p. |
artikel |
|
| 224 | The minimum-area spanning tree problem |
Carmi, Paz |
2006 |
70-71 | 3 |
p. 218-225 8 p. |
artikel |
|
| 225 | The minimum Manhattan network problem: Approximations and exact solutions |
Benkert, Marc |
2006 |
70-71 | 3 |
p. 188-208 21 p. |
artikel |
|
| 226 | The minimum weight triangulation problem with few inner points |
Hoffmann, Michael |
2006 |
70-71 | 3 |
p. 149-158 10 p. |
artikel |
|
| 227 | The ordinary line problem revisited |
Mukhopadhyay, Asish |
2012 |
70-71 | 3 |
p. 127-130 4 p. |
artikel |
|
| 228 | The point in polygon problem for arbitrary polygons |
Hormann, Kai |
2001 |
70-71 | 3 |
p. 131-144 14 p. |
artikel |
|
| 229 | The visibility graph of congruent discs is Hamiltonian |
Rappaport, David |
2003 |
70-71 | 3 |
p. 257-265 9 p. |
artikel |
|
| 230 | Three problems about simple polygons |
Chan, Timothy M. |
2006 |
70-71 | 3 |
p. 209-217 9 p. |
artikel |
|
| 231 | Tight stretch factors for L 1 - and L ∞ -Delaunay triangulations |
Bonichon, Nicolas |
2015 |
70-71 | 3 |
p. 237-250 14 p. |
artikel |
|
| 232 | Tiling space and slabs with acute tetrahedra |
Eppstein, David |
2004 |
70-71 | 3 |
p. 237-255 19 p. |
artikel |
|
| 233 | Time-varying Reeb graphs for continuous space–time data |
Edelsbrunner, Herbert |
2008 |
70-71 | 3 |
p. 149-166 18 p. |
artikel |
|
| 234 | Translating a convex polyhedron over monotone polyhedra |
Asano, Tetsuo |
2002 |
70-71 | 3 |
p. 257-269 13 p. |
artikel |
|
| 235 | Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment |
Goswami, Partha P. |
2004 |
70-71 | 3 |
p. 163-175 13 p. |
artikel |
|
| 236 | Two-variable linear programming in parallel |
Chen, Danny Z. |
2002 |
70-71 | 3 |
p. 155-165 11 p. |
artikel |
|
| 237 | Vertex removal in two-dimensional Delaunay triangulation: Speed-up by low degrees optimization |
Devillers, Olivier |
2011 |
70-71 | 3 |
p. 169-177 9 p. |
artikel |
|
| 238 | Visibility graphs of towers |
Colley, Paul |
1997 |
70-71 | 3 |
p. 161-172 12 p. |
artikel |
|
| 239 | Visibility maps of segments and triangles in 3D |
Moet, Esther |
2008 |
70-71 | 3 |
p. 163-177 15 p. |
artikel |
|
| 240 | Visibility with multiple diffuse reflections |
Prasad, D.Chithra |
1998 |
70-71 | 3 |
p. 187-196 10 p. |
artikel |
|
| 241 | Voronoi drawings of trees |
Liotta, Giuseppe |
2003 |
70-71 | 3 |
p. 147-178 32 p. |
artikel |
|
| 242 | Watchman routes under limited visibility |
Ntafos, Simeon |
1992 |
70-71 | 3 |
p. 149-170 22 p. |
artikel |
|
| 243 | When can a net fold to a polyhedron? |
Biedl, Therese |
2005 |
70-71 | 3 |
p. 207-218 12 p. |
artikel |
|
| 244 | Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces |
Bose, Prosenjit |
2003 |
70-71 | 3 |
p. 209-219 11 p. |
artikel |
244 gevonden resultaten