Abstract
Questions about lines in space arise frequently as subproblems in three-dimensional computational geometry. In this paper we study a number of fundamental combinatorial and algorithmic problems involving arrangements ofn lines in three-dimensional space. Our main results include:1.A tight ź(n2) bound on the maximum combinatorial description complexity of the set of all oriented lines that have specified orientations relative to then given lines.2.A similar bound of ź(n3) for the complexity of the set of all lines passing above then given lines.3.A preprocessing procedure usingO(n2+ź) time and storage, for anyź>0, that builds a structure supportingO(logn)-time queries for testing if a line lies above all the given lines.4.An algorithm that tests the "towering property" inO(n2+ź) time, for anyź>0; don given red lines lie all aboven given blue lines? The tools used to obtain these and other results include Plucker coordinates for lines in space andź-nets for various geometric range spaces.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
