Results 31 to 40 of about 326 (131)
SDFs from Unoriented Point Clouds using Neural Variational Heat Distances
Computer Graphics Forum, EarlyView.We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from unoriented point clouds. We first compute a small time step of heat flow (middle) and then use its gradient directions to solve for a neural SDF (right). Abstract We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from ...
Samuel Weidemaier +5 more
wiley +1 more source
Basis Networks: Learning basis functions for free‐form triangulations
Computer Graphics Forum, EarlyView.Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley +1 more source
LeafFit: Plant Assets Creation from 3D Gaussian Splatting
Computer Graphics Forum, EarlyView.Abstract We propose LeafFit, a pipeline that converts 3D Gaussian Splatting (3DGS) of individual plants into editable, instanced mesh assets. While 3DGS faithfully captures complex foliage, its high memory footprint and lack of mesh topology make it incompatible with traditional game production workflows. We address this by leveraging the repetition of
Chang Luo, Nobuyuki Umetani
wiley +1 more source
Survey on differential estimators for 3d point clouds
Computer Graphics Forum, EarlyView.Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger +4 more
wiley +1 more source
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source
A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded
Computer Graphics Forum, EarlyView.Abstract Grid maps – spatially arranged small multiples – are a powerful tool to show complex geospatial data. Meulemans et al. (2020) introduced a pipeline for computing high‐quality grid maps that are shaped roughly according to their containing geographic outlines.
W. Meulemans
wiley +1 more source
Medial Axis Aware Learning of Signed Distance Functions
Computer Graphics Forum, EarlyView.Abstract We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher‐order variational formulation that enforces linear growth ...
Samuel Weidemaier +2 more
wiley +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
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
Advances in 4D Representation: Geometry, Motion, and Interaction
Computer Graphics Forum, EarlyView.We survey 4D representation through three key pillars — geometry, motion, and interaction — offering a selective, representation‐centric perspective to guide researchers in choosing and customizing the right 4D representation for their tasks. Abstract We present a survey on 4D generation and reconstruction, a fast‐evolving subfield of computer graphics
M. Zhao +7 more
wiley +1 more source