A new 2D tessellation for angle problems: the polar diagram

DOI10.1016/J.COMGEO.2005.11.004zbMATH Open1090.65025OpenAlexW1987680900WikidataQ128213556 ScholiaQ128213556MaRDI QIDQ2489015FDOQ2489015

Authors: Lidia Ortega, C. I. Grima, A. Márquez 

Publication date: 16 May 2006

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.11.004

Recommendations

• Kinetic Polar Diagram
• Dynamic polar diagram
• scientific article; zbMATH DE number 1882491
• Recognizing Voronoi Diagrams with Linear Programming
• scientific article; zbMATH DE number 1424293

zbMATH Keywords

tessellationcomputational geometryconvex hullVoronoi diagramvisibility problemspolar diagrampath planning problemsangle problemsminimal angle criterion

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set
• Title not available (Why is that?)
• Computational geometry on surfaces. Performing computational geometry on the cylinder, the sphere, the torus, and the cone
• A combinatorial theorem in plane geometry
• On the identification of the convex hull of a finite set of points in the plane

Cited In (3)

• Kinetic Polar Diagram
• Dynamic polar diagram
• Title not available (Why is that?)

This page was built for publication: A new 2D tessellation for angle problems: the polar diagram

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