Computable intersection points
From MaRDI portal
Recommendations
- Computable planar curves intersect in a computable point
- Computational complexity of fixed points and intersection points
- Intersection points of planar curves can be computed
- Semicomputable points in Euclidean spaces
- Computing the convex hull of line intersections
- Points on Computable Curves of Computable Lengths
- Intersection theorems with a continuum of intersection points
- Computing curve intersection by homotopy methods
Cited in
(17)- Computing links and accessing arcs
- Computable approximations of a chainable continuum with a computable endpoint
- Chainable and circularly chainable co-r.e. sets in computable metric spaces
- Computability of Subsets of Metric Spaces
- Intersection points of planar curves can be computed
- Co-c.e. sets with disconnected complements
- Computability of chainable graphs
- Local computability of computable metric spaces and computability of co-c.e. continua
- Computability of products of chainable continua
- Computable approximations of semicomputable graphs
- Computability of pseudo-cubes
- Computable subcontinua of semicomputable chainable Hausdorff continua
- Chainable and circularly chainable semicomputable sets in computable topological spaces
- Computable subcontinua of circularly chainable continua
- Computable type of certain quotient spaces
- Computable planar curves intersect in a computable point
- Computability of graphs
This page was built for publication: Computable intersection points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608446)
