Volume 29; Issue 3

Main
Computational Geometry
Volume 29; Issue 3

Computational Geometry

Volume 29; Issue 3

1

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment

Partha P. Goswami, Sandip Das, Subhas C. Nandy

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 181 KB

english, 2004

2

Approximating geometric bottleneck shortest paths

Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel Smid, Norbert Zeh

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 209 KB

english, 2004

3

Editors

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 19 KB

english, 2004

4

Author index of Volume 29

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 50 KB

english, 2004

5

An approximation algorithm for cutting out convex polygons

Adrian Dumitrescu

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 172 KB

english, 2004

6

Rotationally optimal spanning and Steiner trees in uniform orientation metrics

Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 174 KB

english, 2004

7

Linkless symmetric drawings of series parallel digraphs

Seok-Hee Hong, Peter Eades, Jonathan Hillman

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 871 KB

english, 2004

8

Minimal enclosing parallelepiped in 3D

Frédéric Vivien, Nicolas Wicker

Journal:

Computational Geometry

Year:

2004

Language:

english

File:

PDF, 249 KB

english, 2004