Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The Minkowski sum of a simple polygon and a segment

From MaRDI portal
Publication:1007520
Jump to:navigation, search

DOI10.1016/S0020-0190(02)00403-9zbMATH Open1173.68772MaRDI QIDQ1007520FDOQ1007520


Authors: Gennady Pustylnik, Micha Sharir Edit this on Wikidata


Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)





Recommendations

  • Minkowski sums of monotone and general simple polygons
  • On the exact maximum complexity of Minkowski sums of polytopes
  • Convexly independent subsets of Minkowski sums of convex polygons


zbMATH Keywords

computational geometryMinkowski sum


Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)


Cites Work

  • On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles


Cited In (2)

  • Minkowski sums of monotone and general simple polygons
  • Safety Zone Problem





This page was built for publication: The Minkowski sum of a simple polygon and a segment

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1007520&oldid=13000420"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 21:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki