default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Geometry, Volume 18
Volume 18, Number 1, February 2001
- Konstantinos G. Kakoulis, Ioannis G. Tollis:
On the complexity of the Edge Label Placement problem. 1-17 - Binay K. Bhattacharya, Subir Kumar Ghosh:
Characterizing LR-visibility polygons and related problems. 19-36 - Sven Schuierer:
Lower bounds in on-line geometric searching. 37-53 - Ambros Marzetta, Jürg Nievergelt:
Enumerating the k best plane spanning trees. 55-64
Volume 18, Number 2, March 2001
- Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
Hamilton cycles in the path graph of a set of points in convex position. 65-72 - Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama
:
A unified scheme for detecting fundamental curves in binary edge images. 73-93 - Martin Held:
VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments. 95-123
Volume 18, Number 3, April 2001
- Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel searching on m rays. 125-139 - Alberto Bemporad, Komei Fukuda, Fabio Danilo Torrisi:
Convexity recognition of the union of polyhedra. 141-154 - Danny Z. Chen, Jinhui Xu:
An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model. 155-166 - Therese Biedl:
The DFS-heuristic for orthogonal graph drawing. 167-188
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-05 21:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
