Demo Data from VLDB 2026 / reviewers in the wild / expert
Hao Fang 0009
dblp:06/2484-9
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer graphics and multimedia
2 papers |
Geometric modeling and processing · 78% Image and video processing · 22% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › mesh generation › surface meshing
point cloud meshing |
0.4 | 1 | 2020 | Connect-and-Slice: An Hybrid Approach for Reconstructing 3D Objects · CVPR 2020 |
Geometric modeling and processing
surface reconstruction |
0.4 | 1 | 2020 | Connect-and-Slice: An Hybrid Approach for Reconstructing 3D Objects · CVPR 2020 |
Geometric modeling and processing › shape representation
shape abstraction |
0.3 | 1 | 2018 | Planar Shape Detection at Structural Scales · CVPR 2018 |
Image and video processing › pattern detection
shape detection |
0.3 | 1 | 2018 | Planar Shape Detection at Structural Scales · CVPR 2018 |
Methods — techniques the papers use, named apart from their topics
plane detection · 0.4plane connectivity analysis · 0.4supervised energy minimization · 0.3shape collapsing · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Connect-and-Slice: An Hybrid Approach for Reconstructing 3D ObjectsabstractConverting point clouds generated by Laser scanning, multiview stereo imagery or depth cameras into compact polygon meshes is a challenging problem in vision. Existing methods are either robust to imperfect data or scalable, but rarely both. In this paper, we address this issue with an hybrid method that successively connects and slices planes detected from 3D data. The core idea consists in constructing an efficient and compact partitioning data structure. The later is i) spatially-adaptive in the sense that a plane slices a restricted number of relevant planes only, and ii) composed of components with different structural meaning resulting from a preliminary analysis of the plane connectivity. Our experiments on a variety of objects and sensors show the versatility of our approach as well as its competitiveness with respect to existing methods. Hao Fang 0009, Florent Lafarge |
CVPR | 1 |
| 2018 | Planar Shape Detection at Structural ScalesabstractInterpreting 3D data such as point clouds or surface meshes depends heavily on the scale of observation. Yet, existing algorithms for shape detection rely on trial-and-error parameter tunings to output configurations representative of a structural scale. We present a framework to automatically extract a set of representations that capture the shape and structure of man-made objects at different key Abstraction levels. A shape-collapsing process first generates a fine-to-coarse sequence of shape representations by exploiting local planarity. This sequence is then analyzed to identify significant geometric variations between successive representations through a supervised energy minimization. Our framework is flexible enough to learn how to detect both existing structural formalisms such as the CityGML Levels Of Details, and expert-specified levels of Abstraction. Experiments on different input data and classes of man-made objects, as well as comparisons with existing shape detection methods, illustrate the strengths of our approach in terms of efficiency and flexibility. Hao Fang 0009, Florent Lafarge, Mathieu Desbrun |
CVPR | 1 |