A fast modification of Focke's shortest inpolygon construction

DOI10.1080/02331939108843663MaRDI QIDQ3978583zbMATH OpenOpenAlexFDO

Authors Günter Deweß, Petra Helbig

Publication date 25 June 1992

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939108843663

zbMATH Keywords

geometric optimizationoptimal inpolygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Recommendations

• scientific article; zbMATH DE number 123833
• Enhanced modified-polygon method for point-in-polygon problem
• A finite descent method for Steiner's problem of inpolygons with minimal circumference
• Shortest polygonal paths in space
• Does a point lie inside a polygon ?

Cites work

• A finite descent method for Steiner's problem of inpolygons with minimal circumference
• Ein konstruktives lösungsverfahren für das roblem des inpolygons kleinsten Umfangs Von J Steiner

Cited in

(2)

• Enhanced modified-polygon method for point-in-polygon problem
• scientific article; zbMATH DE number 123833 (Why is no real title available?)

This page was built for publication: A fast modification of Focke's shortest inpolygon construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978583)