Implicit convex polygons

DOI10.1023/A:1015626820950zbMath1021.90036OpenAlexW1480727810MaRDI QIDQ1868264

Francisco Gómez, Godfried T. Toussaint, Vera Sacristán, Suneeta Ramaswami, Ferran Hurtado

Publication date: 27 April 2003

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015626820950

zbMATH Keywords

complexitylinear programminglinear constraintscomputational geometryprune-and-searchgeometric object representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS

This page was built for publication: Implicit convex polygons