Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Solid shape
High-order essentially nonsocillatory schemes for Hamilton-Jacobi equations
SIAM Journal on Numerical Analysis
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Ray Shooting Amidst Convex Polyhedra and PolyhedralTerrains in Three Dimensions
SIAM Journal on Computing
Ray shooting amidst convex polygons in 2D
Journal of Algorithms
Real-time occlusion culling for models with large occluders
Proceedings of the 1997 symposium on Interactive 3D graphics
Temporally coherent conservative visibility
Selected papers from the 12th annual symposium on Computational Geometry
Visual motion of curves and surfaces
Visual motion of curves and surfaces
Conservative volumetric visibility with occluder fusion
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Conservative visibility preprocessing using extended projections
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Motion of curves in three spatial dimensions using a level set approach
Journal of Computational Physics
Motion of curves constrained on surfaces using a level-set approach
Journal of Computational Physics
Rapid and accurate computation of the distance function using grids
Journal of Computational Physics
Geometric optics in a phase-space-based level set and Eulerian framework
Journal of Computational Physics
A hidden-surface algorithm with anti-aliasing
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
Estimation of 3D Surface Shape and Smooth Radiance from 2D Images: A Level Set Approach
Journal of Scientific Computing
The Expected Number of 3D Visibility Events Is Linear
SIAM Journal on Computing
On surface radiation conditions for high-frequency wave scattering
Journal of Computational and Applied Mathematics
Properties of a Level Set Algorithm for the Visibility Problems
Journal of Scientific Computing
Node fault robustness for heterogeneous dynamic sensor networks
IMACS'08 Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems
A unified approach for heterogeneity and node fault robustness in dynamic sensor networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Mobile sensors networks under communication constraints
WSEAS TRANSACTIONS on SYSTEMS
Redundant coverage for noise reduction in dynamic sensor networks
WSEAS TRANSACTIONS on SYSTEMS
Measurement noise reduction in dynamic sensor networks
ICS'08 Proceedings of the 12th WSEAS international conference on Systems
Visibility of point clouds and mapping of unknown environments
ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
Shape from Silhouette Consensus
Pattern Recognition
Multiview visibility estimation for image-based modeling
Journal of Computer Science and Technology - Special issue on Natural Language Processing
Information-Seeking Control Under Visibility-Based Uncertainty
Journal of Mathematical Imaging and Vision
Scalable visibility color map construction in spatial databases
Information Systems
Hi-index | 31.45 |
We investigate the problem of determining visible regions given a set of (moving) obstacles and a (moving) vantage point. Our approach to this problem is through an implicit framework, where the obstacles are represented by a level set function. The visibility problem is formally formulated as a boundary value problem (BVP) of a first order partial differential equation. It is based on the continuation of values along the given ray field. We propose a one-pass, multi-level algorithm for the construction of the solution on a grid. Furthermore, we study the dynamics of shadow boundaries on the surfaces of the obstacles when the vantage point moves along a given trajectory. In all of these situations, topological changes such as merging and breaking occur in the regions of interest. These are automatically handled by the level set framework proposed here. Finally, we obtain additional useful information through simple operations in the level set framework.