Abstract
ABSTRACT In this paper, a fast common edge extraction method based on a two-level grid indexing strategy was proposed for eliminating the common edge ‘cracks’. A coarse-grained first-level grid index was firstly built which maps each polygon with its intersecting polygons in the graphics set; secondly, a fine-grained second-level grid index is established linking each grid cell with the vertices falling into the cell, which can be used to quickly find the common points shared by intersecting polygons. The common edge ‘cracks’ problem can be solved if the deleted common points are consistent on two adjacent graphics during compression.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
