Graphics in flatland revisited

DOI10.1007/3-540-52846-6_80zbMath1502.68339OpenAlexW1488791567MaRDI QIDQ5056094

Michel Pocchiola

Publication date: 9 December 2022

Published in: SWAT 90 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-52846-6_80

Mathematics Subject Classification ID

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

Related Items (4)

Randomized approximation algorithms for planar visibility counting problem ⋮ Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment ⋮ Visibility and ray shooting queries in polygonal domains ⋮ Visibility testing and counting

Cites Work

• Visibility and intersection problems in plane geometry
• Computing the visibility polygon from an edge
• Filtering Search: A New Approach to Query-Answering
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• A linear algorithm for computing the visibility polygon from a point
• Optimal Search in Planar Subdivisions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphics in flatland revisited