Abstract
Three-dimensional geometric constraint solving is a rapidly developing field, with applications in areas such as kinematics, molecular modeling, surveying, and geometric theorem proving. While two-dimensional constraint solving has been studied extensively, there remain many open questions in the arena of three-dimensional problems. In this paper, we continue the development of our previous work on configuring a set of points and planes in three-space so that the configuration satisfies a given system of constraints. The constraint system considered consists of six geometric elements and pairwise constraints between triples of the elements. We first review the basic techniques developed in our earlier work germane to the current problem and explain how the problem we consider in this paper occurs. We then demonstrate how to solve the case of a geometric constraint system with four points and two planes.
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.
