Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new algorithm for the two-polygon containment problem

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

DOI10.1016/S0305-0548(96)00050-0zbMath0889.90159MaRDI QIDQ1373882

Roger B. Grinde, Tom M. Cavalier

Publication date: 22 June 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)


zbMATH Keywords

parametric programmingtwo-polygon containment problem


Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)


Related Items

Optimal clustering of a pair of irregular objects



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Solution approaches to irregular nesting problems
  • Containment of a single polygon using mathematical programming
  • Multiple translational containment. II: Exact algorithms
  • Multiple translational containment. I: An approximate algorithm
  • Polygon containment under translation
  • Polygon placement under translation and rotation
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1373882&oldid=13521305"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki