nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Abstract order type extension and new results on the rectilinear crossing number
|
Aichholzer, Oswin |
|
2007 |
70-71 |
1 |
p. 2-15 14 p. |
artikel |
2 |
Adaptive spacetime meshing for discontinuous Galerkin methods
|
Thite, Shripad |
|
2009 |
70-71 |
1 |
p. 20-44 25 p. |
artikel |
3 |
Adaptive subdivision and the length and energy of Bézier curves
|
Gravesen, Jens |
|
1997 |
70-71 |
1 |
p. 13-31 19 p. |
artikel |
4 |
Algorithms for bivariate medians and a Fermat–Torricelli problem for lines
|
Aloupis, Greg |
|
2003 |
70-71 |
1 |
p. 69-79 11 p. |
artikel |
5 |
Algorithms for bivariate zonoid depth
|
Gopala, Harish |
|
2008 |
70-71 |
1 |
p. 2-13 12 p. |
artikel |
6 |
Algorithms for generalized halfspace range searching and other intersection searching problems
|
Gupta, Prosenjit |
|
1996 |
70-71 |
1 |
p. 1-19 19 p. |
artikel |
7 |
A lower bound for β-skeleton belonging to minimum weight triangulations ☆ ☆ This work is partially supported by NSERC grant OPG0041629.
|
Wang, Cao An |
|
2001 |
70-71 |
1 |
p. 35-46 12 p. |
artikel |
8 |
A multi-dimensional approach to force-directed layouts of large graphs
|
Gajer, Pawel |
|
2004 |
70-71 |
1 |
p. 3-18 16 p. |
artikel |
9 |
Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron
|
Fukuda, Komei |
|
1997 |
70-71 |
1 |
p. 1-12 12 p. |
artikel |
10 |
A new upper bound for the VC-dimension of visibility regions
|
Gilbers, Alexander |
|
2014 |
70-71 |
1 |
p. 61-74 14 p. |
artikel |
11 |
Announcements and call for papers
|
|
|
1998 |
70-71 |
1 |
p. 55-58 4 p. |
artikel |
12 |
An optimal parallel algorithm using exclusive read/writes for the rectilinear Voronoi diagram
|
Guha, Sumanta |
|
1993 |
70-71 |
1 |
p. 37-52 16 p. |
artikel |
13 |
A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs
|
Figueroa, Ana Paulina |
|
2009 |
70-71 |
1 |
p. 90-91 2 p. |
artikel |
14 |
A note on the perimeter of fat objects
|
Bose, Prosenjit |
|
2011 |
70-71 |
1 |
p. 1-8 8 p. |
artikel |
15 |
Approximate range searching in higher dimension
|
Chazelle, Bernard |
|
2008 |
70-71 |
1 |
p. 24-29 6 p. |
artikel |
16 |
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
|
Fung, Stanley P.Y. |
|
2005 |
70-71 |
1 |
p. 1-12 12 p. |
artikel |
17 |
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
|
Klein, Rolf |
|
2006 |
70-71 |
1 |
p. 28-34 7 p. |
artikel |
18 |
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
|
Seidel, Raimund |
|
1991 |
70-71 |
1 |
p. 51-64 14 p. |
artikel |
19 |
A unified and efficient solution to the room search problem
|
Tan, Xuehou |
|
2008 |
70-71 |
1 |
p. 45-60 16 p. |
artikel |
20 |
Automatic deduction in (dynamic) geometry: Loci computation
|
Botana, Francisco |
|
2014 |
70-71 |
1 |
p. 75-89 15 p. |
artikel |
21 |
Average case analysis of dynamic geometric optimization
|
Eppstein, David |
|
1996 |
70-71 |
1 |
p. 45-68 24 p. |
artikel |
22 |
Beta-skeletons have unbounded dilation
|
Eppstein, David |
|
2002 |
70-71 |
1 |
p. 43-52 10 p. |
artikel |
23 |
Characterizing LR-visibility polygons and related problems ☆ ☆ The extended abstract of this paper was presented at the Tenth Canadian Conference on Computational Geometry, 1998.
|
Bhattacharya, Binay K. |
|
2001 |
70-71 |
1 |
p. 19-36 18 p. |
artikel |
24 |
Classroom examples of robustness problems in geometric computations
|
Kettner, Lutz |
|
2008 |
70-71 |
1 |
p. 61-78 18 p. |
artikel |
25 |
Closed rectangle-of-influence drawings for irreducible triangulations
|
Sadasivam, Sadish |
|
2011 |
70-71 |
1 |
p. 9-19 11 p. |
artikel |
26 |
Computational geometric aspects of rhythm, melody, and voice-leading
|
Toussaint, Godfried |
|
2010 |
70-71 |
1 |
p. 2-22 21 p. |
artikel |
27 |
Computing a subgraph of the minimum weight triangulation
|
Keil, J.Mark |
|
1994 |
70-71 |
1 |
p. 18-26 9 p. |
artikel |
28 |
Computing D-convex hulls in the plane
|
Franěk, Vojtěch |
|
2009 |
70-71 |
1 |
p. 81-89 9 p. |
artikel |
29 |
Computing straight-line 3D grid drawings of graphs in linear volume
|
Di Giacomo, Emilio |
|
2005 |
70-71 |
1 |
p. 26-58 33 p. |
artikel |
30 |
Constrained CVT meshes and a comparison of triangular mesh generators
|
Nguyen, Hoa |
|
2009 |
70-71 |
1 |
p. 1-19 19 p. |
artikel |
31 |
Constructing convex 3-polytopes from two triangulations of a polygon
|
Marlin, Benjamin |
|
2004 |
70-71 |
1 |
p. 41-47 7 p. |
artikel |
32 |
Convex developments of a regular tetrahedron
|
Akiyama, Jin |
|
2006 |
70-71 |
1 |
p. 2-10 9 p. |
artikel |
33 |
Convexity minimizes pseudo-triangulations
|
Aichholzer, Oswin |
|
2004 |
70-71 |
1 |
p. 3-10 8 p. |
artikel |
34 |
Cubic plane graphs on a given point set
|
Schmidt, Jens M. |
|
2015 |
70-71 |
1 |
p. 1-13 13 p. |
artikel |
35 |
Curve-constrained drawings of planar graphs
|
Di Giacomo, Emilio |
|
2005 |
70-71 |
1 |
p. 1-23 23 p. |
artikel |
36 |
Derandomizing an output-sensitive convex hull algorithm in three dimensions
|
Chazelle, Bernard |
|
1995 |
70-71 |
1 |
p. 27-32 6 p. |
artikel |
37 |
Detecting and decomposing self-overlapping curves
|
Shor, Peter W. |
|
1992 |
70-71 |
1 |
p. 31-50 20 p. |
artikel |
38 |
Distinct distances determined by subsets of a point set in space
|
Avis, David |
|
1991 |
70-71 |
1 |
p. 1-11 11 p. |
artikel |
39 |
Edge-unfolding nested polyhedral bands
|
Aloupis, Greg |
|
2008 |
70-71 |
1 |
p. 30-42 13 p. |
artikel |
40 |
Editorial
|
Iacono, John |
|
2010 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
41 |
Editorial
|
Akiyama, Jin |
|
2003 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
42 |
Editorial
|
Rossignac, Jarek |
|
1999 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
43 |
Editorial
|
Goodrich, M. |
|
2000 |
70-71 |
1 |
p. 1-2 2 p. |
artikel |
44 |
Editorial
|
Bose, Prosenjit |
|
2008 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
45 |
Editorial
|
Akiyama, Jin |
|
2006 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
46 |
Editorial
|
de Berg, Mark |
|
2007 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
47 |
Editorial
|
Hurtado, Ferran |
|
2007 |
70-71 |
1 |
p. 1-2 2 p. |
artikel |
48 |
Editorial
|
Streinu, Ileana |
|
2004 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
49 |
Editorial
|
|
|
1991 |
70-71 |
1 |
p. vii-viii nvt p. |
artikel |
50 |
Editorial Board
|
|
|
2009 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
51 |
Editorial Board
|
|
|
1998 |
70-71 |
1 |
p. ii- 1 p. |
artikel |
52 |
Editorial Board
|
|
|
1998 |
70-71 |
1 |
p. ii- 1 p. |
artikel |
53 |
Editorial Board
|
|
|
1996 |
70-71 |
1 |
p. v- 1 p. |
artikel |
54 |
Editorial Board
|
|
|
1997 |
70-71 |
1 |
p. ii- 1 p. |
artikel |
55 |
Editorial Board
|
|
|
2006 |
70-71 |
1 |
p. CO2- 1 p. |
artikel |
56 |
Editorial Board
|
|
|
2005 |
70-71 |
1 |
p. CO2- 1 p. |
artikel |
57 |
Editorial Board
|
|
|
2007 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
58 |
Editorial Board
|
|
|
2007 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
59 |
Editorial Board
|
|
|
2008 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
60 |
Editorial Board
|
|
|
2008 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
61 |
Editorial board
|
|
|
1991 |
70-71 |
1 |
p. v-vi nvt p. |
artikel |
62 |
Editorial Board
|
|
|
1992 |
70-71 |
1 |
p. v-vi nvt p. |
artikel |
63 |
Editorial board
|
|
|
1993 |
70-71 |
1 |
p. v-vi nvt p. |
artikel |
64 |
Editorial board
|
|
|
1994 |
70-71 |
1 |
p. iii-iv nvt p. |
artikel |
65 |
Editorial Board
|
|
|
1995 |
70-71 |
1 |
p. v-vi nvt p. |
artikel |
66 |
Editors
|
|
|
2003 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
67 |
Editors
|
|
|
2003 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
68 |
Editors
|
|
|
2005 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
69 |
Editors
|
|
|
2004 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
70 |
Editors
|
|
|
2004 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
71 |
Editors
|
|
|
2004 |
70-71 |
1 |
p. IFC- 1 p. |
artikel |
72 |
Efficient algorithms for line and curve segment intersection using restricted predicates
|
Boissonnat, Jean-Daniel |
|
2000 |
70-71 |
1 |
p. 35-52 18 p. |
artikel |
73 |
Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs
|
Bereg, Sergey |
|
2008 |
70-71 |
1 |
p. 37-44 8 p. |
artikel |
74 |
Efficient algorithms for the minimum diameter bridge problem
|
Tokuyama, Takeshi |
|
2003 |
70-71 |
1 |
p. 11-18 8 p. |
artikel |
75 |
Efficient approximation algorithms for clustering point-sets
|
Xu, Guang |
|
2010 |
70-71 |
1 |
p. 59-66 8 p. |
artikel |
76 |
Efficient on-line algorithms for Euler diagram region computation
|
Cordasco, Gennaro |
|
2011 |
70-71 |
1 |
p. 52-68 17 p. |
artikel |
77 |
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses ☆ ☆ A preliminary version of this report was presented at the Fifth Canadian Conference on Computational Geometry [32].
|
Mount, David M. |
|
2001 |
70-71 |
1 |
p. 1-33 33 p. |
artikel |
78 |
Encompassing colored planar straight line graphs
|
Hurtado, Ferran |
|
2008 |
70-71 |
1 |
p. 14-23 10 p. |
artikel |
79 |
Entropy-bounded representation of point grids
|
Farzan, Arash |
|
2014 |
70-71 |
1 |
p. 1-14 14 p. |
artikel |
80 |
Enumerating the k best plane spanning trees
|
Marzetta, Ambros |
|
2001 |
70-71 |
1 |
p. 55-64 10 p. |
artikel |
81 |
Equitable subdivisions within polygonal regions
|
Bereg, Sergey |
|
2006 |
70-71 |
1 |
p. 20-27 8 p. |
artikel |
82 |
Euclidean position in Euclidean 2-orbifolds
|
Cortés, C. |
|
2004 |
70-71 |
1 |
p. 27-41 15 p. |
artikel |
83 |
Exact and approximation algorithms for computing optimal fat decompositions
|
Damian, Mirela |
|
2004 |
70-71 |
1 |
p. 19-27 9 p. |
artikel |
84 |
Expected asymptotically optimal planar point location
|
Iacono, John |
|
2004 |
70-71 |
1 |
p. 19-22 4 p. |
artikel |
85 |
Facility location and the geometric minimum-diameter spanning tree
|
Gudmundsson, Joachim |
|
2004 |
70-71 |
1 |
p. 87-106 20 p. |
artikel |
86 |
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
|
Carr, Hamish |
|
2010 |
70-71 |
1 |
p. 42-58 17 p. |
artikel |
87 |
Flips in planar graphs
|
Bose, Prosenjit |
|
2009 |
70-71 |
1 |
p. 60-80 21 p. |
artikel |
88 |
Floodlight illumination of infinite wedges
|
Cary, Matthew |
|
2010 |
70-71 |
1 |
p. 23-34 12 p. |
artikel |
89 |
Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami
|
Demaine, Erik D. |
|
2000 |
70-71 |
1 |
p. 3-21 19 p. |
artikel |
90 |
Generalized guarding and partitioning for rectilinear polygons
|
Györi, Ervin |
|
1996 |
70-71 |
1 |
p. 21-44 24 p. |
artikel |
91 |
Generating realistic terrains with higher-order Delaunay triangulations
|
de Kok, Thierry |
|
2007 |
70-71 |
1 |
p. 52-65 14 p. |
artikel |
92 |
Geometric permutations of balls with bounded size disparity
|
Zhou, Yunhong |
|
2003 |
70-71 |
1 |
p. 3-20 18 p. |
artikel |
93 |
Geometric permutations of higher dimensional spheres
|
Huang, Yingping |
|
2004 |
70-71 |
1 |
p. 47-60 14 p. |
artikel |
94 |
Grid drawings of k-colourable graphs
|
Wood, David R. |
|
2005 |
70-71 |
1 |
p. 25-28 4 p. |
artikel |
95 |
Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs
|
Karavelas, Menelaos I. |
|
2011 |
70-71 |
1 |
p. 20-51 32 p. |
artikel |
96 |
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
|
Mirzaian, Andranik |
|
1992 |
70-71 |
1 |
p. 15-30 16 p. |
artikel |
97 |
Higher order Delaunay triangulations
|
Gudmundsson, Joachim |
|
2002 |
70-71 |
1 |
p. 85-98 14 p. |
artikel |
98 |
How to get close to the median shape
|
Har-Peled, Sariel |
|
2007 |
70-71 |
1 |
p. 39-51 13 p. |
artikel |
99 |
Illumination by floodlights
|
Steiger, William |
|
1998 |
70-71 |
1 |
p. 57-70 14 p. |
artikel |
100 |
Improved visibility representation of plane graphs
|
Zhang, Huaming |
|
2005 |
70-71 |
1 |
p. 29-39 11 p. |
artikel |
101 |
Interlocked open and closed linkages with few joints
|
Demaine, Erik D. |
|
2003 |
70-71 |
1 |
p. 37-45 9 p. |
artikel |
102 |
Kinetic sorting and kinetic convex hulls
|
Ali Abam, Mohammad |
|
2007 |
70-71 |
1 |
p. 16-26 11 p. |
artikel |
103 |
Learning smooth shapes by probing
|
Boissonnat, Jean-Daniel |
|
2007 |
70-71 |
1 |
p. 38-58 21 p. |
artikel |
104 |
Linear approximation of simple objects
|
Robert, Jean-Marc |
|
1994 |
70-71 |
1 |
p. 27-52 26 p. |
artikel |
105 |
Local properties of geometric graphs
|
Cardinal, Jean |
|
2008 |
70-71 |
1 |
p. 55-64 10 p. |
artikel |
106 |
Lower bounds in on-line geometric searching
|
Schuierer, Sven |
|
2001 |
70-71 |
1 |
p. 37-53 17 p. |
artikel |
107 |
Lower bounds on stabbing lines in 3-space
|
Pellegrini, M. |
|
1993 |
70-71 |
1 |
p. 53-58 6 p. |
artikel |
108 |
Matching colored points in the plane: Some new results
|
Dumitrescu, Adrian |
|
2001 |
70-71 |
1 |
p. 69-85 17 p. |
artikel |
109 |
Maximizing the overlap of two planar convex sets under rigid motions
|
Ahn, Hee-Kap |
|
2007 |
70-71 |
1 |
p. 3-15 13 p. |
artikel |
110 |
Merging visibility maps
|
Overmars, Mark H. |
|
1991 |
70-71 |
1 |
p. 35-49 15 p. |
artikel |
111 |
Minimal link visibility paths inside a simple polygon
|
Alsuwaiyel, Muhammed H. |
|
1993 |
70-71 |
1 |
p. 1-25 25 p. |
artikel |
112 |
Minimum-area enclosing triangle with a fixed angle
|
Bose, Prosenjit |
|
2014 |
70-71 |
1 |
p. 90-109 20 p. |
artikel |
113 |
Minimum dilation stars
|
Eppstein, David |
|
2007 |
70-71 |
1 |
p. 27-37 11 p. |
artikel |
114 |
Minimum-width grid drawings of plane graphs
|
Chrobak, Marek |
|
1998 |
70-71 |
1 |
p. 29-54 26 p. |
artikel |
115 |
Models and motion planning
|
de Berg, Mark |
|
2002 |
70-71 |
1 |
p. 53-68 16 p. |
artikel |
116 |
Moving coins
|
Abellanas, Manuel |
|
2006 |
70-71 |
1 |
p. 35-48 14 p. |
artikel |
117 |
Multiresolution banded refinement to accelerate surface reconstruction from polygons
|
Fix, James D. |
|
1999 |
70-71 |
1 |
p. 49-64 16 p. |
artikel |
118 |
Nearly equal distances and Szemerédi's regularity lemma
|
Pach, János |
|
2006 |
70-71 |
1 |
p. 11-19 9 p. |
artikel |
119 |
New results on stabbing segments with a polygon
|
Díaz-Báñez, José Miguel |
|
2015 |
70-71 |
1 |
p. 14-29 16 p. |
artikel |
120 |
Note on an art gallery problem
|
Csizmadia, György |
|
1998 |
70-71 |
1 |
p. 47-55 9 p. |
artikel |
121 |
[No title]
|
Biedl, Therese |
|
2003 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
122 |
[No title]
|
Jaromczyk, Jerzy W. |
|
2004 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
123 |
[No title]
|
Everett, Hazel |
|
2004 |
70-71 |
1 |
p. 1- 1 p. |
artikel |
124 |
On a counterexample to a conjecture of Mirzaian
|
Urabe, Masatsugu |
|
1992 |
70-71 |
1 |
p. 51-53 3 p. |
artikel |
125 |
On compatible triangulations of simple polygons
|
Aronov, Boris |
|
1993 |
70-71 |
1 |
p. 27-35 9 p. |
artikel |
126 |
On corners of objects built from parallelepiped bricks
|
Damian, Mirela |
|
2008 |
70-71 |
1 |
p. 43-54 12 p. |
artikel |
127 |
On finding maximum-cardinality symmetric subsets
|
Brass, Peter |
|
2003 |
70-71 |
1 |
p. 19-25 7 p. |
artikel |
128 |
On optimal guillotine partitions approximating optimal d-box partitions
|
Gonzalez, Teofilo F. |
|
1994 |
70-71 |
1 |
p. 1-11 11 p. |
artikel |
129 |
On rectilinear link distance
|
de Berg, Mark |
|
1991 |
70-71 |
1 |
p. 13-34 22 p. |
artikel |
130 |
On simplifying dot maps
|
de Berg, Mark |
|
2004 |
70-71 |
1 |
p. 43-62 20 p. |
artikel |
131 |
On some geometric selection and optimization problems via sorted matrices
|
Glozman, Alex |
|
1998 |
70-71 |
1 |
p. 17-28 12 p. |
artikel |
132 |
On some monotone path problems in line arrangements
|
Dumitrescu, Adrian |
|
2005 |
70-71 |
1 |
p. 13-25 13 p. |
artikel |
133 |
On the chromatic number of some geometric type Kneser graphs
|
Araujo, G. |
|
2005 |
70-71 |
1 |
p. 59-69 11 p. |
artikel |
134 |
On the complexity of orthogonal compaction ☆ ☆ Research supported in part by the CNR Project “Geometria Computazionale Robusta con Applicazioni alla Grafica ed al CAD”, by the ESPRIT LTR Project 20244 (ALCOM-IT), and by “Progetto Algoritmi per Grandi Insiemi di Dati: Scienza e Ingegneria”, MURST Programmi di Ricerca di Rilevante Interesse Nazionale.
|
Patrignani, Maurizio |
|
2001 |
70-71 |
1 |
p. 47-67 21 p. |
artikel |
135 |
On the complexity of the Edge Label Placement problem ☆ ☆ Research supported in part by NIST, Advanced Technology Program grant number 70NANB5H1162.
|
Kakoulis, Konstantinos G. |
|
2001 |
70-71 |
1 |
p. 1-17 17 p. |
artikel |
136 |
On the density of iterated line segment intersections
|
Grüne, Ansgar |
|
2008 |
70-71 |
1 |
p. 23-36 14 p. |
artikel |
137 |
On the development of the intersection of a plane with a polytope
|
O'Rourke, Joseph |
|
2003 |
70-71 |
1 |
p. 3-10 8 p. |
artikel |
138 |
On the geometric dilation of closed curves, graphs, and point sets
|
Dumitrescu, Adrian |
|
2007 |
70-71 |
1 |
p. 16-38 23 p. |
artikel |
139 |
Optimal core-sets for balls
|
Bădoiu, Mihai |
|
2008 |
70-71 |
1 |
p. 14-22 9 p. |
artikel |
140 |
Optimally computing a shortest weakly visible line segment inside a simple polygon
|
Bhattacharya, Binay K. |
|
2002 |
70-71 |
1 |
p. 1-29 29 p. |
artikel |
141 |
Optimal placement of convex polygons to maximize point containment
|
Dickerson, Matthew |
|
1998 |
70-71 |
1 |
p. 1-16 16 p. |
artikel |
142 |
Optimal simplification of polygonal chains for subpixel-accurate rendering
|
Buzer, Lilian |
|
2009 |
70-71 |
1 |
p. 45-59 15 p. |
artikel |
143 |
Optimal slope selection via cuttings
|
Brönnimann, Hervé |
|
1998 |
70-71 |
1 |
p. 23-29 7 p. |
artikel |
144 |
Optimal spanners for axis-aligned rectangles
|
Asano, Tetsuo |
|
2005 |
70-71 |
1 |
p. 59-77 19 p. |
artikel |
145 |
Ordered theta graphs
|
Bose, Prosenjit |
|
2004 |
70-71 |
1 |
p. 11-18 8 p. |
artikel |
146 |
Orthogonal polygon reconstruction from stabbing information
|
Jackson, L. |
|
2002 |
70-71 |
1 |
p. 69-83 15 p. |
artikel |
147 |
Overlap of convex polytopes under rigid motion
|
Ahn, Hee-Kap |
|
2014 |
70-71 |
1 |
p. 15-24 10 p. |
artikel |
148 |
Packing polyominoes clumsily
|
Walzer, Stefan |
|
2014 |
70-71 |
1 |
p. 52-60 9 p. |
artikel |
149 |
Packing two disks in a polygon
|
Bespamyatnikh, Sergei |
|
2002 |
70-71 |
1 |
p. 31-42 12 p. |
artikel |
150 |
Pointed binary encompassing trees: Simple and optimal
|
Hoffmann, Michael |
|
2010 |
70-71 |
1 |
p. 35-41 7 p. |
artikel |
151 |
Point labeling with sliding labels
|
van Kreveld, Marc |
|
1999 |
70-71 |
1 |
p. 21-47 27 p. |
artikel |
152 |
Polygonal chain approximation: a query based approach
|
Daescu, Ovidiu |
|
2005 |
70-71 |
1 |
p. 41-58 18 p. |
artikel |
153 |
Practical methods for approximating shortest paths on a convex polytope in R 3
|
Hershberger, John |
|
1998 |
70-71 |
1 |
p. 31-46 16 p. |
artikel |
154 |
Proximate point searching
|
Demaine, Erik D. |
|
2004 |
70-71 |
1 |
p. 29-40 12 p. |
artikel |
155 |
Pushing blocks is hard
|
Demaine, Erik D. |
|
2003 |
70-71 |
1 |
p. 21-36 16 p. |
artikel |
156 |
Queries with segments in Voronoi diagrams
|
Bespamyatnikh, Sergei |
|
2000 |
70-71 |
1 |
p. 23-33 11 p. |
artikel |
157 |
Relative neighborhood graphs in three dimensions
|
Agarwal, Pankaj K. |
|
1992 |
70-71 |
1 |
p. 1-14 14 p. |
artikel |
158 |
Rotational polygon containment and minimum enclosure using only robust 2D constructions
|
Milenkovic, Victor J. |
|
1999 |
70-71 |
1 |
p. 3-19 17 p. |
artikel |
159 |
Segment endpoint visibility graphs are Hamiltonian
|
Hoffmann, Michael |
|
2003 |
70-71 |
1 |
p. 47-68 22 p. |
artikel |
160 |
Speeding up the incremental construction of the union of geometric objects in practice
|
Ezra, Eti |
|
2004 |
70-71 |
1 |
p. 63-85 23 p. |
artikel |
161 |
Steiner hull algorithm for the uniform orientation metrics
|
Wulff-Nilsen, Christian |
|
2008 |
70-71 |
1 |
p. 1-13 13 p. |
artikel |
162 |
Sum of edge lengths of a multigraph drawn on a convex polygon
|
Ito, Hiro |
|
2003 |
70-71 |
1 |
p. 41-47 7 p. |
artikel |
163 |
Testing congruence and symmetry for general 3-dimensional objects
|
Brass, Peter |
|
2004 |
70-71 |
1 |
p. 3-11 9 p. |
artikel |
164 |
Testing orthogonal shapes
|
Romanik, Kathleen |
|
1995 |
70-71 |
1 |
p. 33-49 17 p. |
artikel |
165 |
The optimality of a certain purely recursive dissection for a sequentially n-divisible square
|
Akiyama, Jin |
|
2003 |
70-71 |
1 |
p. 27-39 13 p. |
artikel |
166 |
The rectangle of influence drawability problem
|
Liotta, G. |
|
1998 |
70-71 |
1 |
p. 1-22 22 p. |
artikel |
167 |
The shortest distance among points in general position
|
Tóth, Géza |
|
1997 |
70-71 |
1 |
p. 33-38 6 p. |
artikel |
168 |
The structure of optimal partitions of orthogonal polygons into fat rectangles
|
O'Rourke, Joseph |
|
2004 |
70-71 |
1 |
p. 49-71 23 p. |
artikel |
169 |
The visibility–Voronoi complex and its applications
|
Wein, Ron |
|
2007 |
70-71 |
1 |
p. 66-87 22 p. |
artikel |
170 |
The visible perimeter of an arrangement of disks
|
Nivasch, Gabriel |
|
2014 |
70-71 |
1 |
p. 42-51 10 p. |
artikel |
171 |
The weighted farthest color Voronoi diagram on trees and graphs
|
Hurtado, Ferran |
|
2004 |
70-71 |
1 |
p. 13-26 14 p. |
artikel |
172 |
Tiling figures of the plane with two bars
|
Beauquier, Danièle |
|
1995 |
70-71 |
1 |
p. 1-25 25 p. |
artikel |
173 |
Triangulating with high connectivity
|
Dey, Tamal Krishna |
|
1997 |
70-71 |
1 |
p. 39-56 18 p. |
artikel |
174 |
Triangulations without pointed spanning trees
|
Aichholzer, Oswin |
|
2008 |
70-71 |
1 |
p. 79-83 5 p. |
artikel |
175 |
Turn-regularity and optimal area drawings of orthogonal representations
|
Bridgeman, Stina S. |
|
2000 |
70-71 |
1 |
p. 53-93 41 p. |
artikel |
176 |
Tutte's barycenter method applied to isotopies
|
Colin de Verdière, Éric |
|
2003 |
70-71 |
1 |
p. 81-97 17 p. |
artikel |
177 |
Upward planar drawings on the standing and the rolling cylinders
|
Brandenburg, Franz J. |
|
2014 |
70-71 |
1 |
p. 25-41 17 p. |
artikel |
178 |
Using generic programming for designing a data structure for polyhedral surfaces
|
Kettner, Lutz |
|
1999 |
70-71 |
1 |
p. 65-90 26 p. |
artikel |
179 |
Weak ϵ-nets have basis of size O ( 1 / ϵ log ( 1 / ϵ ) ) in any dimension
|
Mustafa, Nabil H. |
|
2008 |
70-71 |
1 |
p. 84-91 8 p. |
artikel |
180 |
When can you fold a map?
|
Arkin, Esther M. |
|
2004 |
70-71 |
1 |
p. 23-46 24 p. |
artikel |