Computability in computational geometry
From MaRDI portal
Recommendations
Cited in
(12)- scientific article; zbMATH DE number 16658 (Why is no real title available?)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- scientific article; zbMATH DE number 1487958 (Why is no real title available?)
- Computability of convex sets
- Computability of partial Delaunay triangulation and Voronoi diagram (extended abstract)
- scientific article; zbMATH DE number 7376056 (Why is no real title available?)
- Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties
- The Geometry of Computation-Graph Abstraction
- Geometric Computations on Indecisive Points
- Computability Theory and Differential Geometry
- \(P\) versus \(NP\) and geometry
- Nonrealizability proofs in computational geometry
This page was built for publication: Computability in computational geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717029)