<i>HPRO</i>: Direct Visibility of Point Clouds for Optimization

Abstract Given a point cloud, which is assumed to be a sampling of a continuous surface, and a viewpoint, which points are visible from that viewpoint? Since points do not occlude each other, the real question is which points would be visible if the surface they were sampled from were known. While an existing approximation method addresses this problem, it is unsuitable for use in optimization processes or learning models due to its lack of differentiability. To overcome this limitation, the paper introduces a novel differentiable approximation method. It is based on identifying the extreme points of a point set in a differentiable manner. This approach can be effectively integrated into optimization algorithms or used as a layer in neural networks, allowing for the computation and utilization of visible points in various tasks, such as optimal viewpoint selection. The paper also provides theoretical proofs of the operator's correctness in the limit, further validating its effectiveness. The code is available at https://github.com/sagikatz/HPRO

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2025-04-17
DOI
https://doi.org/10.1111/cgf.70046
Citations
1
Primary Topic
3D Shape Modeling and Analysis
Type
article
Field-Weighted Citation Impact
1.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HPRO: Direct Visibility of Point Clouds for Optimization

Ayellet Tal, Sagi Katz
1 citations
Computer Graphics Forum
3D Shape Modeling and Analysis
1.33
article

HPRO: Direct Visibility of Point Clouds for Optimization

Ayellet Tal, Sagi Katz
article en
1 citations

Abstract

Abstract Given a point cloud, which is assumed to be a sampling of a continuous surface, and a viewpoint, which points are visible from that viewpoint? Since points do not occlude each other, the real question is which points would be visible if the surface they were sampled from were known. While an existing approximation method addresses this problem, it is unsuitable for use in optimization processes or learning models due to its lack of differentiability. To overcome this limitation, the paper introduces a novel differentiable approximation method. It is based on identifying the extreme points of a point set in a differentiable manner. This approach can be effectively integrated into optimization algorithms or used as a layer in neural networks, allowing for the computation and utilization of visible points in various tasks, such as optimal viewpoint selection. The paper also provides theoretical proofs of the operator's correctness in the limit, further validating its effectiveness. The code is available at https://github.com/sagikatz/HPRO

Computer Graphics ForumVol. 44(2)
Technion – Israel Institute of Technology (IL)
Israel Science Foundation
Openalex Percentile: Top 24%
3D Shape Modeling and Analysis
1.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.