nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A linear time algorithm to remove winding of a simple polygon
|
Bhattacharya, Binay Kumar |
|
2006 |
33 |
3 |
p. 165-173 9 p. |
artikel |
2 |
Approximate range searching using binary space partitions
|
de Berg, Mark |
|
2006 |
33 |
3 |
p. 139-151 13 p. |
artikel |
3 |
A result about the density of iterated line intersections in the plane
|
Hillar, Christopher J. |
|
2006 |
33 |
3 |
p. 106-114 9 p. |
artikel |
4 |
Author index of Volume 33
|
|
|
2006 |
33 |
3 |
p. 186-187 2 p. |
artikel |
5 |
Editorial Board
|
|
|
2006 |
33 |
3 |
p. CO2- 1 p. |
artikel |
6 |
Farthest-point queries with geometric and combinatorial constraints
|
Daescu, Ovidiu |
|
2006 |
33 |
3 |
p. 174-185 12 p. |
artikel |
7 |
Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
|
Ahn, Hee-Kap |
|
2006 |
33 |
3 |
p. 152-164 13 p. |
artikel |
8 |
On the sizes of Delaunay meshes
|
Cheng, Siu-Wing |
|
2006 |
33 |
3 |
p. 130-138 9 p. |
artikel |
9 |
Progress on maximum weight triangulation
|
Qian, Jianbo |
|
2006 |
33 |
3 |
p. 99-105 7 p. |
artikel |
10 |
Proximity problems on line segments spanned by points
|
Daescu, Ovidiu |
|
2006 |
33 |
3 |
p. 115-129 15 p. |
artikel |