Solving Spatial Constraints with Generalized Distance Geometry

Lu Yang

Chapter Chapter 6 in Distance Geometry, 2013, pp 95-120 from Springer

Abstract: Abstract This is a short survey about how to use a generalization of distance geometry to solve spatial constraints. Described first are definitions and some basic theorems in the generalized distance geometry, and a systematic approach for the solution of spatial constraints follows, making use of results of the previous section. An intrinsic coordinate system based on geometric invariants, named distance coordinate system, is established for simplification and algorithmization to the process of constraint solving. A short program is proposed, which implements the algorithm producing automatically a complete set of constraint equations for a given point-plane configuration, and the point-line-plane configurations are converted into point-plane ones beforehand. The so-called nontypical constraint problem is considered in the last section and illustrated by an example, which the previous method seems unable to help.

Keywords: Generalized distance geometry; Distance coordinate; Spatial constraint solving; Point-line-plane configuration (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-5128-0_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461451280

DOI: 10.1007/978-1-4614-5128-0_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().