Orthogonal axial line placement in chains and trees of orthogonal rectangles

dc.contributor.author	Sanders, ID
dc.contributor.author	Watts, DC
dc.contributor.author	Hall, AD
dc.date.accessioned	2018-06-15T07:45:24Z
dc.date.available	2018-06-15T07:45:24Z
dc.date.created	2000
dc.date.issued	2000
dc.identifier.citation	Sanders ID, Watts DC & Hall AD (2000) Orthogonal axial line placement in chains and trees of orthogonal rectangles. South African Computer Journal, Number 25, 2000	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/24395
dc.description.abstract	Previous research has shown that the orthogonal axial line placement problem for orthogonal rectangles is NP-complete in general but also that there are restrictions of the problem for which polynomial time solutions can be obtained. This article presents algorithms which solve two restricted versions of the orthogonal axial line placement problem - chains and trees of orthogonal rectangles. These restricted versions are slightly more general than the polynomial time versions previously presented.	en
dc.language.iso	en	en
dc.publisher	South African Computer Society (SAICSIT)	en
dc.subject	Computational geometry	en
dc.subject	NP-complete problems	en
dc.subject	Covering	en
dc.subject	Guarding	en
dc.subject	Orthogonal rectangles	en
dc.subject	Axial lines	en
dc.title	Orthogonal axial line placement in chains and trees of orthogonal rectangles	en
dc.type	Article	en