About tracing problems in dynamic geometry
From MaRDI portal
Publication:1943666
DOI10.1007/s00454-012-9473-xzbMath1262.65025OpenAlexW2086942670MaRDI QIDQ1943666
Publication date: 20 March 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-012-9473-x
algorithmcritical pointinterval arithmeticcontinuation methodsdynamic geometrygeometric straight-line programgeometry software Cinderellatracing problem
Interval and finite arithmetic (65G30) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (3)
About tracing problems in dynamic geometry ⋮ Non-standard analysis in dynamic geometry ⋮ The reachability problem in constructive geometric constraint solving based dynamic geometry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the k-th root in circular arithmetic
- Rigorous global search: continuous problems
- Taylor forms -- use and limits.
- About tracing problems in dynamic geometry
- Affine arithmetic: concepts and applications
- Interval arithmetic, affine arithmetic, Taylor series methods: Why, what next?
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- A new robust algorithm to trace curves
- An Interval Step Control for Continuation Methods
- The Cinderella.2 Manual
- Automated Deduction in Geometry
This page was built for publication: About tracing problems in dynamic geometry
