The reachability problem in constructive geometric constraint solving based dynamic geometry

DOI10.1007/s10817-013-9280-yzbMath1315.68228OpenAlexW1993643646MaRDI QIDQ2352486

Marta R. Hidalgo, Robert Joan-Arinyo

Publication date: 2 July 2015

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/91262

zbMATH Keywords

reachabilitydynamic geometryconstructive geometric constraint solving

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• DynBCN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability problems. 3rd international workshop, RP 2009, Palaiseau, France, September 23--25, 2009. Proceedings
• Geometric constraint solver
• About tracing problems in dynamic geometry
• On graphs and rigidity of plane skeletal structures
• CORRECTNESS PROOF OF A GEOMETRIC CONSTRAINT SOLVER
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• On Generic Rigidity in the Plane
• Automated Deduction in Geometry
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• Decomposition plans for geometric constraint problems. II: New algorithms

This page was built for publication: The reachability problem in constructive geometric constraint solving based dynamic geometry