A heuristic mesh that minimizes expected triangle edge expansions cuts average visibility-region query times by 12-16% versus constrained Delaunay triangulations on realistic maps.
IEICE Transactions 68(9), 557–559 (1985)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
A heuristic mesh that minimizes expected triangle edge expansions cuts average visibility-region query times by 12-16% versus constrained Delaunay triangulations on realistic maps.