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

An improved algorithm for intersecting convex polygons

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

DOI10.1016/S0020-0190(96)00195-0zbMath1336.68267OpenAlexW2094091137MaRDI QIDQ286975

Youssef G. Saab

Publication date: 26 May 2016

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00195-0


zbMATH Keywords

algorithmsconvex polygonscomputational geometry


Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)




Cites Work

  • A new linear algorithm for intersecting convex polygons
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:286975&oldid=12169624"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 03:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki