Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             178 results found
no title author magazine year volume issue page(s) type
1 A (1+ε)-approximation algorithm for 2-line-center Agarwal, Pankaj K.
 2003
 70-71 2 p. 119-128
10 p.
 article
2 A class of point-sets with few k-sets Alt, Helmut
 2000
 70-71 2 p. 95-101
7 p.
 article
3 A computationally intractable problem on simplicial complexes Eğecioğlu, Ömer
 1996
 70-71 2 p. 85-98
14 p.
 article
4 A convex polygon among polygonal obstacles: placement and high-clearance motion Chew, L.Paul
 1993
 70-71 2 p. 59-89
31 p.
 article
5 A decomposition-based approach to layered manufacturing ☆ ☆ A preliminary version of this paper appears in the Proceedings of the Seventh International Workshop on Algorithms and Data Structures, Providence, RI, 8–10 August 2001, LNCS 2125, pp. 389–400. Ilinkin, Ivaylo
 2002
 70-71 2 p. 117-151
35 p.
 article
6 A fast algorithm for approximating the detour of a polygonal chain Ebbers-Baumann, Annette
 2004
 70-71 2 p. 123-134
12 p.
 article
7 A linear time algorithm for approximate 2-means clustering Sabharwal, Yogish
 2005
 70-71 2 p. 159-172
14 p.
 article
8 Almost all Delaunay triangulations have stretch factor greater than π / 2 Bose, Prosenjit
 2011
 70-71 2 p. 121-127
7 p.
 article
9 A lower bound on the number of triangulations of planar point sets Aichholzer, Oswin
 2004
 70-71 2 p. 135-145
11 p.
 article
10 An algorithm for constructing star-shaped drawings of plane graphs Hong, Seok-Hee
 2010
 70-71 2 p. 191-206
16 p.
 article
11 An algorithm for constructing the convex hull of a set of spheres in dimension d Boissonnat, Jean-Daniel
 1996
 70-71 2 p. 123-130
8 p.
 article
12 An aperiodic tiles machine Cáceres, José
 2002
 70-71 2 p. 171-182
12 p.
 article
13 An efficient local approach to convexity testing of piecewise-linear hypersurfaces Rybnikov, Konstantin
 2009
 70-71 2 p. 147-172
26 p.
 article
14 A new 2D tessellation for angle problems: The polar diagram Grima, Clara I.
 2006
 70-71 2 p. 58-74
17 p.
 article
15 An incremental algorithm for reconstruction of surfaces of arbitrary codimension Freedman, Daniel
 2007
 70-71 2 p. 106-116
11 p.
 article
16 An inequality on the edge lengths of triangular meshes Jiang, Minghui
 2011
 70-71 2 p. 100-103
4 p.
 article
17 An O(nlogn) algorithm for the zoo-keeper's problem Bespamyatnikh, Sergei
 2003
 70-71 2 p. 63-74
12 p.
 article
18 An output sensitive algorithm for discrete convex hulls Har-Peled, Sariel
 1998
 70-71 2 p. 125-138
14 p.
 article
19 Approximate congruence in nearly linear time Indyk, Piotr
 2003
 70-71 2 p. 115-128
14 p.
 article
20 Approximately matching polygonal curves with respect to the Fréchet distance Mosig, Axel
 2005
 70-71 2 p. 113-127
15 p.
 article
21 Approximating polyhedral objects with deformable smooth surfaces Cheng, Ho-lun
 2008
 70-71 2 p. 104-117
14 p.
 article
22 Approximating the minimum weight spanning tree of a set of points in the Hausdorff metric Alvarez, Victor
 2010
 70-71 2 p. 94-98
5 p.
 article
23 Approximation of convex figures by pairs of rectangles Schwarzkopf, Otfried
 1998
 70-71 2 p. 77-87
11 p.
 article
24 Area, perimeter and derivatives of a skin curve Cheng, Ho-Lun
 2003
 70-71 2 p. 173-192
20 p.
 article
25 A Tverberg-type result on multicolored simplices Pach, János
 1998
 70-71 2 p. 71-76
6 p.
 article
26 A unified scheme for detecting fundamental curves in binary edge images Asano, Tetsuo
 2001
 70-71 2 p. 73-93
21 p.
 article
27 Bichromatic 2-center of pairs of points Arkin, Esther M.
 2015
 70-71 2 p. 94-107
14 p.
 article
28 Blocking Delaunay triangulations Aichholzer, Oswin
 2013
 70-71 2 p. 154-159
6 p.
 article
29 Bounded-degree polyhedronization of point sets Barequet, Gill
 2013
 70-71 2 p. 148-153
6 p.
 article
30 Casting a polyhedron with directional uncertainty Ahn, Hee-Kap
 2003
 70-71 2 p. 129-141
13 p.
 article
31 Chips on wafers, or packing rectangles into grids Andersson, Mattias
 2005
 70-71 2 p. 95-111
17 p.
 article
32 Clarkson's algorithm for violator spaces Brise, Yves
 2011
 70-71 2 p. 70-81
12 p.
 article
33 Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited Freedman, Daniel
 2002
 70-71 2 p. 227-241
15 p.
 article
34 Competitive searching in a generalized street Datta, Amitava
 1999
 70-71 2 p. 109-120
12 p.
 article
35 Complexity of the minimum-length corridor problem Gonzalez-Gutierrez, Arturo
 2007
 70-71 2 p. 72-103
32 p.
 article
36 Computing bushy and thin triangulations Shermer, Thomas
 1991
 70-71 2 p. 115-125
11 p.
 article
37 Computing contour trees in all dimensions Carr, Hamish
 2003
 70-71 2 p. 75-94
20 p.
 article
38 Computing half-plane and strip discrepancy of planar point sets de Berg, Mark
 1996
 70-71 2 p. 69-83
15 p.
 article
39 Computing minimum length paths of a given homotopy class Hershberger, John
 1994
 70-71 2 p. 63-97
35 p.
 article
40 Computing the dilation of edge-augmented graphs in metric spaces Wulff-Nilsen, Christian
 2010
 70-71 2 p. 68-72
5 p.
 article
41 Configurations with few crossings in topological graphs Knauer, Christian
 2007
 70-71 2 p. 104-114
11 p.
 article
42 Conic nearest neighbor queries and approximate Voronoi diagrams Funke, Stefan
 2015
 70-71 2 p. 76-86
11 p.
 article
43 Connected dominating sets on dynamic geometric graphs Guibas, Leonidas
 2013
 70-71 2 p. 160-172
13 p.
 article
44 Constrained paths in the flip-graph of regular triangulations Pournin, L.
 2007
 70-71 2 p. 134-140
7 p.
 article
45 Convex polygons with few intervertex distances Fishburn, Peter
 1995
 70-71 2 p. 65-93
29 p.
 article
46 Cooperative mobile guards in grids Kosowski, Adrian
 2007
 70-71 2 p. 59-71
13 p.
 article
47 Cylindrical static and kinetic binary space partitions Agarwal, Pankaj K.
 2000
 70-71 2 p. 103-127
25 p.
 article
48 Decomposition of multiple coverings into many parts Pach, János
 2009
 70-71 2 p. 127-133
7 p.
 article
49 Decompositions and boundary coverings of non-convex fat polyhedra de Berg, Mark
 2010
 70-71 2 p. 73-83
11 p.
 article
50 Delaunay triangulations approximate anchor hulls Dey, Tamal K.
 2007
 70-71 2 p. 131-143
13 p.
 article
51 Determining bar-representability for ordered weighted graphs Kirkpatrick, David G.
 1996
 70-71 2 p. 99-122
24 p.
 article
52 Determining maximum k-width-connectivity on meshes Hambrusch, Susanne E.
 1993
 70-71 2 p. 91-105
15 p.
 article
53 Drawing cubic graphs with at most five slopes Keszegh, Balázs
 2008
 70-71 2 p. 138-147
10 p.
 article
54 Dynamic algorithms for geometric spanners of small diameter: Randomized solutions Arya, Sunil
 1999
 70-71 2 p. 91-107
17 p.
 article
55 Edge guards in rectilinear polygons Bjorling-Sachs, Iliana
 1998
 70-71 2 p. 111-123
13 p.
 article
56 Editorial Agarwal, Pankaj K.
 2003
 70-71 2 p. 49-
1 p.
 article
57 Editorial Lazard, Sylvain
 2010
 70-71 2 p. 67-
1 p.
 article
58 Editorial Board 2009
 70-71 2 p. IFC-
1 p.
 article
59 Editorial Board 2006
 70-71 2 p. CO2-
1 p.
 article
60 Editorial Board 2005
 70-71 2 p. CO2-
1 p.
 article
61 Editorial Board 2007
 70-71 2 p. IFC-
1 p.
 article
62 Editorial Board 2007
 70-71 2 p. CO2-
1 p.
 article
63 Editorial Board 2008
 70-71 2 p. IFC-
1 p.
 article
64 Editorial Board 2008
 70-71 2 p. IFC-
1 p.
 article
65 Editors 2003
 70-71 2 p. IFC-
1 p.
 article
66 Editors 2003
 70-71 2 p. IFC-
1 p.
 article
67 Editors 2004
 70-71 2 p. IFC-
1 p.
 article
68 Editors 2005
 70-71 2 p. IFC-
1 p.
 article
69 Editors 2004
 70-71 2 p. IFC-
1 p.
 article
70 Efficient generation of triconnected plane triangulations Nakano, Shin-ichi
 2004
 70-71 2 p. 109-122
14 p.
 article
71 Equiprojective polyhedra Hasan, Masud
 2008
 70-71 2 p. 148-155
8 p.
 article
72 Escaping offline searchers and isoperimetric theorems Brass, Peter
 2009
 70-71 2 p. 119-126
8 p.
 article
73 Exact arithmetic at low cost – A case study in linear programming Gärtner, Bernd
 1999
 70-71 2 p. 121-139
19 p.
 article
74 Expected time analysis for Delaunay point location Devroye, Luc
 2004
 70-71 2 p. 61-89
29 p.
 article
75 External polygon containment problems Sharir, Micha
 1994
 70-71 2 p. 99-118
20 p.
 article
76 Fast greedy triangulation algorithms Dickerson, Matthew T.
 1997
 70-71 2 p. 67-86
20 p.
 article
77 Fast local searches and updates in bounded universes Bose, Prosenjit
 2013
 70-71 2 p. 181-189
9 p.
 article
78 Finding constrained and weighted Voronoi diagrams in the plane Wang, Cao An
 1998
 70-71 2 p. 89-104
16 p.
 article
79 Finding minimum hidden guard sets in polygons—tight approximability results Eidenbenz, Stephan
 2006
 70-71 2 p. 49-57
9 p.
 article
80 Finding the Θ-guarded region Matijević, Domagoj
 2010
 70-71 2 p. 207-218
12 p.
 article
81 Foreword Durocher, Stephane
 2013
 70-71 2 p. 119-
1 p.
 article
82 Foreword Klein, Rolf
 2005
 70-71 2 p. 79-
1 p.
 article
83 Fréchet distance with speed limits Maheshwari, Anil
 2011
 70-71 2 p. 110-120
11 p.
 article
84 Fully dynamic delaunay triangulation in logarithmic expected time per operation Devillers, Olivier
 1992
 70-71 2 p. 55-80
26 p.
 article
85 Functional specification and prototyping with oriented combinatorial maps Dufourd, Jean-François
 2000
 70-71 2 p. 129-156
28 p.
 article
86 Further results on arithmetic filters for geometric predicates Devillers, Olivier
 1999
 70-71 2 p. 141-148
8 p.
 article
87 Geometric spanners with small chromatic number Bose, Prosenjit
 2009
 70-71 2 p. 134-146
13 p.
 article
88 Guarding scenes against invasive hypercubes de Berg, Mark
 2003
 70-71 2 p. 99-117
19 p.
 article
89 Guest Editor's foreword Evans, William
 2011
 70-71 2 p. 69-
1 p.
 article
90 Hamilton cycles in the path graph of a set of points in convex position Rivera-Campo, Eduardo
 2001
 70-71 2 p. 65-72
8 p.
 article
91 Hausdorff approximation of convex polygons Lopez, Mario A.
 2005
 70-71 2 p. 139-158
20 p.
 article
92 Hierarchy of surface models and irreducible triangulations Cheng, Siu-Wing
 2004
 70-71 2 p. 135-150
16 p.
 article
93 Highway hull revisited Aloupis, Greg
 2010
 70-71 2 p. 115-130
16 p.
 article
94 Homogeneous 2-hop broadcast in 2D Das, Gautam K.
 2010
 70-71 2 p. 182-190
9 p.
 article
95 How to draw the minimum cuts of a planar graph Brandes, Ulrik
 2004
 70-71 2 p. 117-133
17 p.
 article
96 Independent set of intersection graphs of convex objects in 2D Agarwal, Pankaj K.
 2006
 70-71 2 p. 83-95
13 p.
 article
97 Inner and outer approximations of polytopes using boxes Bemporad, Alberto
 2004
 70-71 2 p. 151-178
28 p.
 article
98 Integer point sets minimizing average pairwise L 1 distance: What is the optimal shape of a town? Demaine, Erik D.
 2011
 70-71 2 p. 82-94
13 p.
 article
99 Intersection of unit-balls and diameter of a point set in R 3 Ramos, Edgar A.
 1997
 70-71 2 p. 57-65
9 p.
 article
100 I/O-efficient dynamic planar point location Arge, Lars
 2004
 70-71 2 p. 147-162
16 p.
 article
101 Iterated snap rounding Halperin, Dan
 2002
 70-71 2 p. 209-225
17 p.
 article
102 Kinetic and dynamic data structures for convex hulls and upper envelopes Alexandron, Giora
 2007
 70-71 2 p. 144-158
15 p.
 article
103 Locality and bounding-box quality of two-dimensional space-filling curves Haverkort, Herman
 2010
 70-71 2 p. 131-147
17 p.
 article
104 Lower bounds for expected-case planar point location Malamatos, Theocharis
 2008
 70-71 2 p. 91-103
13 p.
 article
105 Matching edges and faces in polygonal partitions Aichholzer, O.
 2008
 70-71 2 p. 134-141
8 p.
 article
106 Matching point sets with respect to the Earth Mover's Distance Cabello, Sergio
 2008
 70-71 2 p. 118-133
16 p.
 article
107 Matching points with rectangles and squares Bereg, Sergey
 2009
 70-71 2 p. 93-108
16 p.
 article
108 Maximum overlap and minimum convex hull of two convex polyhedra under translations Ahn, Hee-Kap
 2008
 70-71 2 p. 171-177
7 p.
 article
109 Measuring and computing natural generators for homology groups Chen, Chao
 2010
 70-71 2 p. 169-181
13 p.
 article
110 Minimizing the sum of diameters efficiently Hershberger, John
 1992
 70-71 2 p. 111-118
8 p.
 article
111 Mixed volume techniques for embeddings of Laman graphs Steffens, Reinhard
 2010
 70-71 2 p. 84-93
10 p.
 article
112 Negative results on characterizing visibility graphs Everett, H.
 1995
 70-71 2 p. 51-63
13 p.
 article
113 Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations Üngör, Alper
 2009
 70-71 2 p. 109-118
10 p.
 article
114 Off-line dynamic maintenance of the width of a planar point set Agarwal, Pankaj K.
 1991
 70-71 2 p. 65-78
14 p.
 article
115 Oja centers and centers of gravity Chen, Dan
 2013
 70-71 2 p. 140-147
8 p.
 article
116 On circumscribing polygons for line segments Pach, János
 1998
 70-71 2 p. 121-124
4 p.
 article
117 One-dimensional layout optimization, with applications to graph drawing by axis separation Koren, Yehuda
 2005
 70-71 2 p. 115-138
24 p.
 article
118 One strike against the min-max degree triangulation problem Jansen, Klaus
 1993
 70-71 2 p. 107-120
14 p.
 article
119 On finding an empty staircase polygon of largest area (width) in a planar point-set Nandy, Subhas C.
 2003
 70-71 2 p. 143-171
29 p.
 article
120 On graph thickness, geometric thickness, and separator theorems Duncan, Christian A.
 2011
 70-71 2 p. 95-99
5 p.
 article
121 On-line coloring of geometric intersection graphs Erlebach, Thomas
 2002
 70-71 2 p. 243-255
13 p.
 article
122 Online searching with an autonomous robot Fekete, Sándor P.
 2006
 70-71 2 p. 102-115
14 p.
 article
123 On local transformations in plane geometric graphs embedded on small grids Abellanas, Manuel
 2008
 70-71 2 p. 65-77
13 p.
 article
124 On simultaneous planar graph embeddings Brass, Peter
 2007
 70-71 2 p. 117-130
14 p.
 article
125 On the computation of an arrangement of quadrics in 3D Mourrain, Bernard
 2005
 70-71 2 p. 145-164
20 p.
 article
126 On the number of views of translates of a cube and related problems Aronov, Boris
 2004
 70-71 2 p. 179-192
14 p.
 article
127 On the stabbing number of a random Delaunay triangulation Bose, Prosenjit
 2007
 70-71 2 p. 89-105
17 p.
 article
128 On the stretch factor of Delaunay triangulations of points in convex position Cui, Shiliang
 2011
 70-71 2 p. 104-109
6 p.
 article
129 On the variance of random polygons Bárány, Imre
 2013
 70-71 2 p. 173-180
8 p.
 article
130 Optimal Steiner hull algorithm Winter, Pawel
 2002
 70-71 2 p. 163-169
7 p.
 article
131 Optimizing area and aspect ratio in straight-line orthogonal tree drawings Chan, Timothy M.
 2002
 70-71 2 p. 153-162
10 p.
 article
132 Orthogonal drawings of graphs with vertex and edge labels Binucci, Carla
 2005
 70-71 2 p. 71-114
44 p.
 article
133 Orthogonal segment stabbing Katz, Matthew J.
 2005
 70-71 2 p. 197-205
9 p.
 article
134 Parallel rectilinear shortest paths with rectangular obstacles Atallah, Mikhail J.
 1991
 70-71 2 p. 79-113
35 p.
 article
135 Partitions of complete geometric graphs into plane trees Bose, Prosenjit
 2006
 70-71 2 p. 116-125
10 p.
 article
136 Planarity-preserving clustering and embedding for large planar graphs Duncan, Christian A.
 2003
 70-71 2 p. 95-114
20 p.
 article
137 Point location among hyperplanes and unidirectional ray-shooting Chazelle, Bernard
 1994
 70-71 2 p. 53-62
10 p.
 article
138 Polygon exploration with time-discrete vision Fekete, Sándor P.
 2010
 70-71 2 p. 148-168
21 p.
 article
139 Preferred directions for resolving the non-uniqueness of Delaunay triangulations Dyken, Christopher
 2006
 70-71 2 p. 96-101
6 p.
 article
140 Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in d-dimensions Arkin, Esther M.
 2015
 70-71 2 p. 134-146
13 p.
 article
141 Probabilistic matching of planar regions Alt, Helmut
 2010
 70-71 2 p. 99-114
16 p.
 article
142 Proximity drawings in polynomial area and volume Penna, Paolo
 2004
 70-71 2 p. 91-116
26 p.
 article
143 Publisher's note Sevenster, Arjen
 2004
 70-71 2 p. 107-
1 p.
 article
144 Quadtree, ray shooting and approximate minimum weight Steiner triangulation Cheng, Siu-Wing
 2002
 70-71 2 p. 99-116
18 p.
 article
145 Query point visibility computation in polygons with holes Zarei, Alireza
 2008
 70-71 2 p. 78-90
13 p.
 article
146 Recursive geometry of the flow complex and topology of the flow complex filtration Buchin, Kevin
 2008
 70-71 2 p. 115-137
23 p.
 article
147 Relaxing the constraints of clustered planarity Angelini, Patrizio
 2015
 70-71 2 p. 42-75
34 p.
 article
148 Reporting intersecting pairs of convex polytopes in two and three dimensions Agarwal, Pankaj K.
 2002
 70-71 2 p. 195-207
13 p.
 article
149 Separation and approximation of polyhedral objects Mitchell, Joseph S.B.
 1995
 70-71 2 p. 95-114
20 p.
 article
150 Seven mutually touching infinite cylinders Bozóki, Sándor
 2015
 70-71 2 p. 87-93
7 p.
 article
151 Shortest monotone descent path problem in polyhedral terrain Roy, Sasanka
 2007
 70-71 2 p. 115-133
19 p.
 article
152 Simple and optimal output-sensitive construction of contour trees using monotone paths Chiang, Yi-Jen
 2005
 70-71 2 p. 165-195
31 p.
 article
153 Simultaneous graph embedding with bends and circular arcs Cappos, Justin
 2009
 70-71 2 p. 173-182
10 p.
 article
154 Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees Chazal, Frédéric
 2008
 70-71 2 p. 156-170
15 p.
 article
155 Some properties of k-Delaunay and k-Gabriel graphs Bose, Prosenjit
 2013
 70-71 2 p. 131-139
9 p.
 article
156 Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time Brönnimann, Hervé
 2006
 70-71 2 p. 75-82
8 p.
 article
157 Spheres, molecules, and hidden surface removal Halperin, Dan
 1998
 70-71 2 p. 83-102
20 p.
 article
158 Stable Roommates Spanner Bose, Prosenjit
 2013
 70-71 2 p. 120-130
11 p.
 article
159 Testing simple polygons Arkin, Esther M.
 1997
 70-71 2 p. 97-114
18 p.
 article
160 The affine representation theorem for abstract convex geometries Kashiwabara, Kenji
 2005
 70-71 2 p. 129-144
16 p.
 article
161 The θ 5 -graph is a spanner Bose, Prosenjit
 2015
 70-71 2 p. 108-119
12 p.
 article
162 The largest k-ball in a d-dimensional box Everett, Hazel
 1998
 70-71 2 p. 59-67
9 p.
 article
163 The one-round Voronoi game replayed Fekete, Sándor P.
 2005
 70-71 2 p. 81-94
14 p.
 article
164 The union of moving polygonal pseudodiscs — Combinatorial bounds and applications de Berg, Mark
 1998
 70-71 2 p. 69-81
13 p.
 article
165 The upper bound theorem for polytopes: an easy proof of its asymptotic version Seidel, Raimund
 1995
 70-71 2 p. 115-116
2 p.
 article
166 The vertex-edge visibility graph of a polygon O'Rourke, Joseph
 1998
 70-71 2 p. 105-120
16 p.
 article
167 The vertex set of a 0 1 -polytope is strongly P -enumerable Bussieck, Michael R
 1998
 70-71 2 p. 103-109
7 p.
 article
168 Three-clustering of points in the plane Hagauer, Johann
 1997
 70-71 2 p. 87-95
9 p.
 article
169 Unfolding Manhattan Towers Damian, Mirela
 2008
 70-71 2 p. 102-114
13 p.
 article
170 Unit distances between vertices of a convex polygon Fishburn, P.C.
 1992
 70-71 2 p. 81-91
11 p.
 article
171 Ununfoldable polyhedra with convex faces Bern, Marshall
 2003
 70-71 2 p. 51-62
12 p.
 article
172 Upper envelope onion peeling Hershberger, John
 1992
 70-71 2 p. 93-110
18 p.
 article
173 Upward straight-line embeddings of directed graphs into point sets Binucci, Carla
 2010
 70-71 2 p. 219-232
14 p.
 article
174 Visibility and ray shooting queries in polygonal domains Chen, Danny Z.
 2015
 70-71 2 p. 31-41
11 p.
 article
175 Voronoi diagrams on the sphere Na, Hyeon-Suk
 2002
 70-71 2 p. 183-194
12 p.
 article
176 VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments Held, Martin
 2001
 70-71 2 p. 95-123
29 p.
 article
177 Weighted skeletons and fixed-share decomposition Aurenhammer, Franz
 2008
 70-71 2 p. 93-101
9 p.
 article
178 Weighted straight skeletons in the plane Biedl, Therese
 2015
 70-71 2 p. 120-133
14 p.
 article
                             178 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands