Skip to main content

Publisher: Elsevier

Volume 23, Number 1, July 2002

Optimally computing a shortest weakly visible line segment inside a simple polygon
pp. 1-29(29)
Authors: Bhattacharya, B.K.; Das, G.; Mukhopadhyay, A.; Narasimhan, G.

Favourites:
ADD

Packing two disks in a polygon
pp. 31-42(12)
Author: Bespamyatnikh, S.

Favourites:
ADD

Beta-skeletons have unbounded dilation
pp. 43-52(10)
Author: Eppstein, D.

Favourites:
ADD

Models and motion planning
pp. 53-68(16)
Authors: de Berg, M.; Katz, M.J.; Overmars, M.H.; van der Stappen, A.F.; Vleugels, J.

Favourites:
ADD

Orthogonal polygon reconstruction from stabbing information
pp. 69-83(15)
Authors: Jackson, L.; Wismath, S.K.

Favourites:
ADD

Higher order Delaunay triangulations
pp. 85-98(14)
Authors: Gudmundsson, J.; Hammar, M.; van Kreveld, M.

Favourites:
ADD

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more