Algorithmic geometry. Foundations, methods, applications
From MaRDI portal
Recommendations
Cited in
(17)- Systolic algorithms for computational geometry problems - a survey
- An orderly algorithm and some applications in finite geometry
- Topics in absolute anabelian geometry. III: Global reconstruction algorithms
- scientific article; zbMATH DE number 994741 (Why is no real title available?)
- An Enumerative Geometry Framework for Algorithmic Line Problems in \mathbb R^3
- scientific article; zbMATH DE number 4072225 (Why is no real title available?)
- scientific article; zbMATH DE number 16659 (Why is no real title available?)
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 1306029 (Why is no real title available?)
- scientific article; zbMATH DE number 1006218 (Why is no real title available?)
- Convex hull of a planar set of straight and circular line segments
- Algorithmic geometry. Polyhedric and algebraic methods
- Algorithmische Geometrie
- Geometric foundations of numerical algorithms and symmetry
- The limit of \(L_p\) Voronoi diagrams as \(p\rightarrow 0\) is the bounding-box-area Voronoi diagram
- Foundations of geometric algebra computing.
- Triangulations. Structures for algorithms and applications
This page was built for publication: Algorithmic geometry. Foundations, methods, applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082244)