Abstract
We examine the derivation of consistent concurrency relations in uncertain geometry. This work extends previous work on parallelism and collinearity. We introduce the concept of a metadomain, which is defined as the set of parameter vectors of lines passing through two domains, where a domain is defined as the uncertainty region of the parameter vector of a line segment. The intersection graph of the metadomains is introduced as the primary tool to derive concurrency relations.
Cite
CITATION STYLE
Veelaert, P. (2002). Concurrency of line segments in uncertain geometry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2301, pp. 289–300). Springer Verlag. https://doi.org/10.1007/3-540-45986-3_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.