Abstract
AbstractIn this paper we examine concurrency relations between planes whose position is not precisely known. The simplest case consists of four planes, where we have to determine whether the four planes can be forced to pass through one common intersection point by moving them slightly within specified limits. We prove that if such a concurrency relation is possible then it can be found in a finite number of steps by a simple geometrical construction. This result remains valid for larger collections of planes, with multiple concurrency relations, provided each pair of relations shares at most one plane, and the relations do not form cycles.KeywordsDual SpaceSupport PointSupport PlaneParameter PointPrimal SpaceThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
