An O (n log log n)-time algorithm for triangulating a simple polygon
SIAM Journal on Computing
Computing the visibility polygon from a convex set and related problems
Journal of Algorithms
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Identification of inflection points and cusps on rational curves
Computer Aided Geometric Design
Construction Of the Constrained Delaunay Triangulation Of A Polygonal Domain
CAD Systems Development: Tools and Methods [Dagstuhl Seminar, 1995]
Maintaining Visibility of a Polygon with a Moving Point of View
Proceedings of the 8th Canadian Conference on Computational Geometry
Design of a Walkthrough System for Virtual Museum Based on Voronoi Diagram
ISVD '06 Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering
Visibility Algorithms in the Plane
Visibility Algorithms in the Plane
Query point visibility computation in polygons with holes
Computational Geometry: Theory and Applications
Approximate computation of curves on B-spline surfaces
Computer-Aided Design
Visibility queries in a polygonal region
Computational Geometry: Theory and Applications
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
G1 continuous approximate curves on NURBS surfaces
Computer-Aided Design
| Hi-index | 7.29 |
Visibility computation plays an important role in applications such as architectural design, art gallery patrolling and virtual worlds. In this paper, we present an algorithm to compute the weak visibility polygons (WVP) of Non Uniform Rational B-spline (NURBS) curves inside simple polygons. The NURBS curve is first subdivided into triangular curves. We then compute the WVP of each triangular curve by shearing that of its triangle hull. Finally, all triangular curves' WVPs are merged together to obtain the WVP of the NURBS curve. Analysis and examples are given to show the performance of our algorithm.