Pages that link to "Item:Q1779568"

The following pages link to Recent progress in exact geometric computation (Q1779568):

Displaying 18 items.

• A regularization approach for estimating the type of a plane curve singularity (Q385004) (← links)
• Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
• On the topology of real algebraic plane curves (Q626980) (← links)
• A robust algorithm for geometric predicate by error-free determinant transformation (Q714616) (← links)
• Certified computation of planar Morse-Smale complexes (Q739610) (← links)
• Applied computational geometry: Towards robust solutions of basic problems (Q915501) (← links)
• Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere (Q924069) (← links)
• Algorithm for three-dimensional curved block cutting analysis in solid modeling (Q2175279) (← links)
• An adaptable and extensible geometry kernel (Q2371334) (← links)
• Improving root separation bounds (Q2399862) (← links)
• Classroom examples of robustness problems in geometric computations (Q2479475) (← links)
• Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
• Some progress on computational geometry (Q2900325) (← links)
• Foundations of Exact Rounding (Q3605482) (← links)
• Hypergeometric Functions in Exact Geometric Computation (Q4916183) (← links)
• Efficient Predicate Evaluation Using Randomized Degeneracy Detection (Q5057658) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• Fast floating-point filters for robust predicates (Q6040881) (← links)