Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             101 results found
no title author magazine year volume issue page(s) type
1 A decade of CGAL Gärtner, Bernd
2007
70-71 1-2 p. 1-3
3 p.
article
2 Advanced programming techniques applied to Cgal's arrangement package Wein, Ron
2007
70-71 1-2 p. 37-63
27 p.
article
3 A generic software design for Delaunay refinement meshing Rineau, Laurent
2007
70-71 1-2 p. 100-110
11 p.
article
4 Algorithms for area-efficient orthogonal drawings Papakostas, Achilleas
1998
70-71 1-2 p. 83-110
28 p.
article
5 Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL Bandyopadhyay, Deepak
2007
70-71 1-2 p. 4-15
12 p.
article
6 An adaptable and extensible geometry kernel Hert, Susan
2007
70-71 1-2 p. 16-36
21 p.
article
7 An algorithmic study of manufacturing paperclips and other folded structures Arkin, Esther M
2003
70-71 1-2 p. 117-138
22 p.
article
8 An Edgebreaker-based efficient compression scheme for regular meshes Szymczak, Andrzej
2001
70-71 1-2 p. 53-68
16 p.
article
9 An exact and efficient approach for computing a cell in an arrangement of quadrics Schömer, Elmar
2006
70-71 1-2 p. 65-97
33 p.
article
10 A package for exact kinetic data structures and sweepline algorithms Russel, Daniel
2007
70-71 1-2 p. 111-127
17 p.
article
11 Approximate convex decomposition of polygons Lien, Jyh-Ming
2006
70-71 1-2 p. 100-123
24 p.
article
12 Approximating the maxmin-angle covering triangulation Mitchell, Scott A.
1997
70-71 1-2 p. 93-111
19 p.
article
13 Approximation algorithms for lawn mowing and milling ☆ ☆ A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466. Arkin, Esther M.
2000
70-71 1-2 p. 25-50
26 p.
article
14 Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs Drysdale, R.L. Scot
2008
70-71 1-2 p. 31-47
17 p.
article
15 A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case Lemaire, C.
2000
70-71 1-2 p. 69-96
28 p.
article
16 Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments Hachenberger, Peter
2007
70-71 1-2 p. 64-99
36 p.
article
17 Building bridges between convex regions Ahn, Hee-Kap
2003
70-71 1-2 p. 161-170
10 p.
article
18 Checking geometric programs or verification of geometric structures Mehlhorn, Kurt
1999
70-71 1-2 p. 85-103
19 p.
article
19 Combinatorial and experimental results for randomized point matching algorithms Irani, Sandy
1999
70-71 1-2 p. 17-31
15 p.
article
20 Computing the Fréchet distance between simple polygons Buchin, Kevin
2008
70-71 1-2 p. 2-20
19 p.
article
21 Cost-driven octree construction schemes: an experimental study Aronov, Boris
2005
70-71 1-2 p. 127-148
22 p.
article
22 Counterexamples to the uniformity conjecture Richardson, Daniel
2006
70-71 1-2 p. 58-64
7 p.
article
23 Curve reconstruction from noisy samples Cheng, Siu-Wing
2005
70-71 1-2 p. 63-100
38 p.
article
24 Decomposing a simple polygon into pseudo-triangles and convex polygons Gerdjikov, Stefan
2008
70-71 1-2 p. 21-30
10 p.
article
25 Deformable spanners and applications Gao, Jie
2006
70-71 1-2 p. 2-19
18 p.
article
26 Editorial Bremner, David
2001
70-71 1-2 p. 1-
1 p.
article
27 Editorial Katz, Matthew J.
2002
70-71 1-2 p. 1-
1 p.
article
28 Editorial Mehlhorn, K.
2000
70-71 1-2 p. 1-2
2 p.
article
29 Editorial Goodrich, Michael
1999
70-71 1-2 p. 1-2
2 p.
article
30 Editorial Mount, David M.
2005
70-71 1-2 p. 1-
1 p.
article
31 Editorial Boissonnat, Jean-Daniel
2006
70-71 1-2 p. 1-
1 p.
article
32 Editorial Emiris, Ioannis Z.
2008
70-71 1-2 p. 1-
1 p.
article
33 Editorial Board 1998
70-71 1-2 p. ii-
1 p.
article
34 Editorial Board 1997
70-71 1-2 p. ii-
1 p.
article
35 Editorial Board 2006
70-71 1-2 p. CO2-
1 p.
article
36 Editorial Board 2006
70-71 1-2 p. ii-
1 p.
article
37 Editorial Board 2007
70-71 1-2 p. IFC-
1 p.
article
38 Editorial Board 2008
70-71 1-2 p. IFC-
1 p.
article
39 Editors 2003
70-71 1-2 p. IFC-
1 p.
article
40 Editors 2005
70-71 1-2 p. CO2-
1 p.
article
41 Enumerating triangulation paths Dumitrescu, Adrian
2001
70-71 1-2 p. 3-12
10 p.
article
42 Exact, efficient, and complete arrangement computation for cubic curves Eigenwillig, Arno
2006
70-71 1-2 p. 36-73
38 p.
article
43 Extended convex hull Fukuda, Komei
2001
70-71 1-2 p. 13-23
11 p.
article
44 Extending range queries and nearest neighbors Flatland, Robin Y.
2000
70-71 1-2 p. 3-24
22 p.
article
45 Faster core-set constructions and data-stream algorithms in fixed dimensions Chan, Timothy M.
2006
70-71 1-2 p. 20-35
16 p.
article
46 Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations Mücke, Ernst P.
1999
70-71 1-2 p. 63-83
21 p.
article
47 Finding the largest area axis-parallel rectangle in a polygon Daniels, Karen
1997
70-71 1-2 p. 125-148
24 p.
article
48 Foreword Lubiw, A.
1997
70-71 1-2 p. 1-2
2 p.
article
49 Geometric orderings of intersecting translates and their applications Robert, Jean-Marc
1997
70-71 1-2 p. 59-72
14 p.
article
50 Geometric pattern matching under Euclidean motion Chew, L.Paul
1997
70-71 1-2 p. 113-124
12 p.
article
51 Geometric representations of graphs Di Battista, Giuseppe
1998
70-71 1-2 p. 1-2
2 p.
article
52 Guarding disjoint triangles and claws in the plane Tóth, Csaba D
2003
70-71 1-2 p. 51-65
15 p.
article
53 Inner and outer rounding of Boolean operations on lattice polygonal regions Devillers, Olivier
2006
70-71 1-2 p. 3-17
15 p.
article
54 Intersecting quadrics: an efficient and exact implementation Lazard, Sylvain
2006
70-71 1-2 p. 74-99
26 p.
article
55 Linear area upward drawings of AVL trees Crescenzi, P.
1998
70-71 1-2 p. 25-42
18 p.
article
56 Linear complexity hexahedral mesh generation Eppstein , David
1999
70-71 1-2 p. 3-16
14 p.
article
57 LMT-skeleton heuristics for several new classes of optimal triangulations ☆ ☆ This research is supported by the Grant-in-Aid of Ministry of Education, Science, Sports and Culture, of Japan, Grant-in-Aid for Scientific Research(C), 08680377, 1997, and Grant-in-Aid for Scientific Research(B), 10205214, 1998. Dai, Yang
2000
70-71 1-2 p. 51-68
18 p.
article
58 Local polyhedra and geometric graphs Erickson, Jeff
2005
70-71 1-2 p. 101-125
25 p.
article
59 Local transformations of hexahedral meshes of lower valence Hecht, Frédéric
2012
70-71 1-2 p. 62-71
10 p.
article
60 Long proteins with unique optimal foldings in the H-P model Aichholzer, Oswin
2003
70-71 1-2 p. 139-159
21 p.
article
61 LR-visibility in polygons Das, Gautam
1997
70-71 1-2 p. 37-57
21 p.
article
62 Maxima-finding algorithms for multidimensional samples: A two-phase approach Chen, Wei-Mei
2012
70-71 1-2 p. 33-53
21 p.
article
63 Near-quadratic bounds for the L 1 Voronoi diagram of moving points Chew, L.Paul
1997
70-71 1-2 p. 73-80
8 p.
article
64 New results on drawing angle graphs Garg, Ashim
1998
70-71 1-2 p. 43-82
40 p.
article
65 [No title] Alt, Helmut
2003
70-71 1-2 p. 1-
1 p.
article
66 On counting point-hyperplane incidences Brass, Peter
2003
70-71 1-2 p. 13-20
8 p.
article
67 On realistic terrains Moet, Esther
2008
70-71 1-2 p. 48-67
20 p.
article
68 On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time Kahan, Simon
1999
70-71 1-2 p. 33-44
12 p.
article
69 On the performance of the ICP algorithm Ezra, Esther
2008
70-71 1-2 p. 77-93
17 p.
article
70 Optimal and suboptimal robust algorithms for proximity graphs Hurtado, Ferran
2003
70-71 1-2 p. 35-49
15 p.
article
71 Orienting polyhedral parts by pushing Berretty, Robert-Paul
2002
70-71 1-2 p. 21-38
18 p.
article
72 Partial surface matching by using directed footprints Barequet, Gill
1999
70-71 1-2 p. 45-62
18 p.
article
73 Perfect binary space partitions de Berg, Mark
1997
70-71 1-2 p. 81-91
11 p.
article
74 Planar minimally rigid graphs and pseudo-triangulations Haas, Ruth
2005
70-71 1-2 p. 31-61
31 p.
article
75 Polygon decomposition for efficient construction of Minkowski sums Agarwal, Pankaj K.
2002
70-71 1-2 p. 39-61
23 p.
article
76 Polygons cuttable by a circular saw Demaine, Erik D.
2001
70-71 1-2 p. 69-84
16 p.
article
77 Provable surface reconstruction from noisy samples Dey, Tamal K.
2006
70-71 1-2 p. 124-141
18 p.
article
78 Rational orthogonal approximations to orthogonal matrices Milenkovic, Victor J.
1997
70-71 1-2 p. 25-35
11 p.
article
79 Ray shooting and intersection searching amidst fat convex polyhedra in 3-space Aronov, Boris
2008
70-71 1-2 p. 68-76
9 p.
article
80 Reachability by paths of bounded curvature in a convex polygon Ahn, Hee-Kap
2012
70-71 1-2 p. 21-32
12 p.
article
81 Reconfiguring convex polygons Aichholzer, Oswin
2001
70-71 1-2 p. 85-95
11 p.
article
82 Reconstructing 3D compact sets Cazals, Frédéric
2012
70-71 1-2 p. 1-13
13 p.
article
83 Sequences of spanning trees and a fixed tree theorem Aichholzer, Oswin
2002
70-71 1-2 p. 3-20
18 p.
article
84 Sets of lines and cutting out polyhedral objects Jaromczyk, Jerzy W
2003
70-71 1-2 p. 67-95
29 p.
article
85 Smooth kinetic maintenance of clusters Hershberger, John
2005
70-71 1-2 p. 3-30
28 p.
article
86 Special Issue on Robust Geometric Algorithms and their Implementations Yap, Chee
2006
70-71 1-2 p. 1-2
2 p.
article
87 Spirale Reversi: Reverse decoding of the Edgebreaker encoding Isenburg, Martin
2001
70-71 1-2 p. 39-52
14 p.
article
88 Splitting (complicated) surfaces is hard Chambers, Erin W.
2008
70-71 1-2 p. 94-110
17 p.
article
89 Surface reconstruction using umbrella filters Adamy, Udo
2002
70-71 1-2 p. 63-86
24 p.
article
90 Temporally coherent conservative visibility Coorg, Satyan
1999
70-71 1-2 p. 105-124
20 p.
article
91 Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame Bárány, Imre
2012
70-71 1-2 p. 14-20
7 p.
article
92 The medial axis of a union of balls Amenta, Nina
2001
70-71 1-2 p. 25-37
13 p.
article
93 The MST of symmetric disk graphs is light Abu-Affash, A. Karim
2012
70-71 1-2 p. 54-61
8 p.
article
94 The predicates of the Apollonius diagram: Algorithmic analysis and implementation Emiris, Ioannis Z.
2006
70-71 1-2 p. 18-57
40 p.
article
95 The Safari interface for visualizing time-dependent volume data using iso-surfaces and contour spectra Kettner, Lutz
2003
70-71 1-2 p. 97-116
20 p.
article
96 Tight degree bounds for pseudo-triangulations of points Kettner, Lutz
2003
70-71 1-2 p. 3-12
10 p.
article
97 Towards exact geometric computation Yap, Chee-Keng
1997
70-71 1-2 p. 3-23
21 p.
article
98 Translating a regular grid over a point set Bose, Prosenjit
2003
70-71 1-2 p. 21-34
14 p.
article
99 Unit disk graph recognition is NP-hard Breu, Heinz
1998
70-71 1-2 p. 3-24
22 p.
article
100 Universal 3-dimensional visibility representations for graphs Alt, Helmut
1998
70-71 1-2 p. 111-125
15 p.
article
101 Visualizing geometric algorithms over the Web Baker, James E.
1999
70-71 1-2 p. 125-152
28 p.
article
                             101 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands