Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
 
Zoeken naar met titel:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

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