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

How trivial are reliable box-plane intersections?

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

DOI10.1016/S0010-4485(00)00052-XzbMATH Open1206.65059OpenAlexW1967781922WikidataQ126809420 ScholiaQ126809420MaRDI QIDQ628002FDOQ628002

H. Ratschek, J. Rokne

Publication date: 4 March 2011

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0010-4485(00)00052-x




Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07) Computer-aided design (modeling of curves and surfaces) (65D17)



Cited In (3)

  • Line segment intersection testing
  • FAST SOFTWARE FOR BOX INTERSECTIONS
  • Introduction to the special issue: What can one learn from box-plane intersections?

Uses Software

  • C-XSC 2.0


   Recommendations
  • FAST SOFTWARE FOR BOX INTERSECTIONS
  • ERIT—A Collection of Efficient and Reliable Intersection Tests
  • Box-sphere intersection tests
  • Test for intersection between box and tetrahedron
  • Test for intersection between a plane and a connected compact polyhedron





This page was built for publication: How trivial are reliable box-plane intersections?

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

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