Abstract
We present a global constraint that maintains the Euclidean distance between n points.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Batnini, H., Rueher, M.: Semantic decomposition for solving distance constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 964–965. Springer, Heidelberg (2003)
Krippahl, L., Barahona, P.: PSICO: solving protein structures with constraint programming and optimization. Constraints 7(3-4), 317–331 (2002)
Lebbah, Y., Rueher, M., Michel, C.: A global filtering algorithm for handling systems of quadratic equations and inequations. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 109. Springer, Heidelberg (2002)
Markót, M.C.: An interval method to validate optimal solutions of the “packing circles in a unit square” problems. Central European Journal of Operational Research 8, 63–78 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heusch, M. (2003). distn: An Euclidean Distance Global Constraint. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_99
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive