A linear-time construction of Reuleaux polygons
zbMATH Open0876.52002MaRDI QIDQ2365262FDOQ2365262
Authors: Horst Martini, Y. S. Kupitz, Bernd Wegner 
Publication date: 18 November 1997
Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/228209
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Linear-time reconstruction of Delaunay triangulations with applications
- COVERING CONVEX RECTILINEAR POLYGONS IN LINEAR TIME
- Linear-time algorithms for weakly-monotone polygons
- On geodesic properties of polygons relevant to linear time triangulation
- Linear-size nonobtuse triangulation of polygons
- scientific article; zbMATH DE number 4045150
- scientific article; zbMATH DE number 140466
- Computational Science and Its Applications – ICCSA 2004
- A randomized algorithm for triangulating a simple polygon in linear time
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)
Cited In (8)
- Construction of the planar bodies with constant width
- On a measure of asymmetry for Reuleaux polygons
- Ball polytopes and the Vázsonyi problem
- On the isoperimetric inequalities for Reuleaux polygons
- The Reuleaux triangle and its center of mass
- Title not available (Why is that?)
- Ball and spindle convexity with respect to a convex body
- A new construction of curves of constant width
This page was built for publication: A linear-time construction of Reuleaux polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365262)
