The following pages link to (Q4411357):
Displaying 11 items.
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Improving the topology computation of an arrangement of cubics (Q945944) (← links)
- Computing the topology of an arrangement of implicitly defined real algebraic plane curves (Q1045532) (← links)
- \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity (Q1731460) (← links)
- Recent progress in exact geometric computation (Q1779568) (← links)
- Tools for analyzing the intersection curve between two quadrics through projection and lifting (Q2020580) (← links)
- Reachable region query and its applications (Q2201650) (← links)
- Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
- Exact, efficient, and complete arrangement computation for cubic curves (Q2507159) (← links)
- The predicates of the Apollonius diagram: algorithmic analysis and implementation (Q2575585) (← links)
- An exact and efficient approach for computing a cell in an arrangement of quadrics (Q2575587) (← links)