Common intersections of polygons
From MaRDI portal
Publication:911274
DOI10.1016/0020-0190(90)90193-2zbMath0696.68050OpenAlexW2082671478MaRDI QIDQ911274
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90193-2
hypercubeparallel machinesparallel algorithmscomputational geometryCREW PRAMcommon intersection problemmesh computers
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Dynamic computational geometry on meshes and hypercubes
- Some dynamic computational geometry problems
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Almost linear upper bounds on the length of general Davenport-Schinzel sequences
- On the detection of a common intersection of k convex subjects in the plane
- A Combinatorial Problem Connected with Differential Equations
This page was built for publication: Common intersections of polygons