Computing the connected components of simple rectilinear geometrical objects in $d$-space
RAIRO. Inform. théor., 18 2 (1984) 171-183
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Using Reachable Sets for Trajectory Planning of Automated Vehicles
Stefanie Manzinger, Christian Pek and Matthias AlthoffIEEE Transactions on Intelligent Vehicles 6 (2) 232 (2021)
https://doi.org/10.1109/TIV.2020.3017342
1 (2017)
https://doi.org/10.1109/ITSC.2017.8317765
Efficient net extraction for restricted orientation designs [VLSI layout]
M.A. Lopez, R. Janardan and S. SahniIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15 (9) 1151 (1996)
https://doi.org/10.1109/43.536721
On computing connected components of line segments
M.A. Lopez and R. ThurimellaIEEE Transactions on Computers 44 (4) 597 (1995)
https://doi.org/10.1109/12.376174
770 (1993)
https://doi.org/10.1109/ICCAD.1993.580176
Machines, Languages, and Complexity
Derick WoodLecture Notes in Computer Science, Machines, Languages, and Complexity 381 161 (1989)
https://doi.org/10.1007/BFb0015937
Hole Problems for Rectangles in the Plane
Gregory J. E. Rawlins, Peter Widmayer and Derick WoodSIAM Journal on Discrete Mathematics 1 (1) 86 (1988)
https://doi.org/10.1137/0401010
Partitioning and separating sets of orthogonal polygons
Thomas Ottmann, Eljas Soisalon-Soininen and Derick WoodInformation Sciences 42 (1) 31 (1987)
https://doi.org/10.1016/0020-0255(87)90014-4
Time- and space-optimal contour computation for a set of rectangles
Peter Widmayer and Derick WoodInformation Processing Letters 24 (5) 335 (1987)
https://doi.org/10.1016/0020-0190(87)90159-1
On some union and intersection problems for polygons with fixed orientations
P. Widmayer, Y. F. Wu, M. D. F. Schlag and C. K. WongComputing 36 (3) 183 (1986)
https://doi.org/10.1007/BF02240065
Space-economical plane-sweep algorithms
Thomas Ottmann and Derick WoodComputer Vision, Graphics, and Image Processing 34 (1) 35 (1986)
https://doi.org/10.1016/0734-189X(86)90046-0
Divide-and-conquer in planar geometry
Ralf Hartmut GütingInternational Journal of Computer Mathematics 18 (3-4) 247 (1986)
https://doi.org/10.1080/00207168608803493
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
Ralf Hartmut G�tingActa Informatica 21 (3) 271 (1984)
https://doi.org/10.1007/BF00264251