Efficient Observer-Dependent Simplification in Polygonal Domains

Zarei, A ; Sharif University of Technology

197 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00453-011-9488-3
  3. Abstract:
  4. In this paper, we consider a special version of the well-known line-simplification problem for simplifying the boundary of a region illuminated by a point light source q, or its visibility polygon VP(q). In this simplification approach, we should take the position of q as an essential factor into account to determine the quality of the resulting simplification. For this purpose, we redefine the known distance- and area-distortion error criteria as the main simplification criteria to take into account the distance between the observer q and the boundary of VP(q). Based on this, we propose algorithms for simplifying VP(q). More precisely, we propose simplification algorithms of O(n2) and O(n4/3+δ) running time for observer-dependent distance-distortion simplification criterion and an O(n3) simplification algorithm for observer-dependent area-distortion criterion where n is the number of vertices in VP(q). Moreover, we consider the observer-dependent distance-distortion simplification problem in the data streaming model where the vertices of VP(q) are given as a stream and only a constant amount of memory is available
  5. Keywords:
  6. Computational geometry ; Line simplification ; Planar visibility
  7. Source: Algorithmica (New York) ; April , 2011 , Pages 1-21 ; 01784617 (ISSN)
  8. URL: http://link.springer.com/article/10.1007%2Fs00453-011-9488-3