Results 111 to 120 of about 1,471 (203)

Circles of Confidence for Multi‐Label Geometry Completion

Computer Graphics Forum, EarlyView.
Abstract Inside–outside classification is widely used for geometry processing tasks such as surface reconstruction, geometry completion, and calculating signed distance fields. We introduce a new integral formulation of this problem, which assigns confidence scores that points are inside or outside, given incomplete boundary geometry.
Z. Wei, C. Hafner, A. Kalinov, P. Heiss‐Synak, C. Wojtan   +4 more
wiley   +1 more source

Reticulate leaf venation in Pilea peperomioides is a Voronoi diagram. [PDF]

Nat Commun
Zheng CX, Palit S, Venezia M, Blum E, Pedmale UV, Jackson D, Scarpella E, Prusinkiewicz P, Navlakha S.   +8 more
europepmc   +1 more source

Progressive Convex Hull Simplification

Computer Graphics Forum, EarlyView.
Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley   +1 more source

Humanoid Robot Walking and Grasping Method Using Similarity Reward-Augmented Generative Adversarial Imitation Learning. [PDF]

Sensors (Basel)
Huang GY, Li WF.
europepmc   +1 more source

On Bending in the As‐Rigid‐As‐Possible Deformation Energy

Computer Graphics Forum, EarlyView.
Abstract The well‐established As‐Rigid‐As‐Possible (ARAP) energy has various forms. For surface deformation, commonly used energies contain an implicit bending penalty. We present a natural, continuous generalization that incorporates multiple ARAP versions with an implicit, user‐controllable bending penalty.
Ugo Finnendahl, Marc Alexa
wiley   +1 more source

A multi-label sentinel-2 dataset for deep learning-based energy, transport, and storage infrastructure mapping in Germany. [PDF]

Data Brief
Pasold L, Eisentraut L, Waigner F, Buettner R.   +3 more
europepmc   +1 more source

Meshing Unsigned Distance Fields with Regular Triangulations

Computer Graphics Forum, EarlyView.
Abstract Unsigned distance fields (UDF) are a versatile, implicit representation of geometry. They can represent surfaces that are not bounding a solid or contain points or curves that are not manifold, for example several sheets meeting along a common curve. Contouring the implicit representation, i.e. turning it into an explicit one, requires finding
M. Kohlbrenner, M. Alexa
wiley   +1 more source

Towards AI-Powered AR for Enhancing Sports Playability for People with Low Vision: An Exploration of ARSports. [PDF]

IEEE Int Symp Mixed Augment Real Adjun ISMAR Adjun
Lee J, Li Y, Bunarto D, Lee E, Wang OH, Rodriguez A, Zhao Y, Tian Y, Froehlich JE.   +8 more
europepmc   +1 more source

A practical algorithm for weighted k‐hulls

Computer Graphics Forum, EarlyView.
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley   +1 more source

A new approach for bin packing problem using knowledge reuse and improved heuristic. [PDF]

Sci Rep
Fang J, Chen X, Rao Y, Peng Y, Yan K.
europepmc   +1 more source