Results 31 to 40 of about 123 (122)

Basis Networks: Learning basis functions for free‐form triangulations

open access: yesComputer 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

open access: yesComputer 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

Sequentially Hausdorff and full sequentially Hausdorff spaces

open access: yesCommunications Faculty Of Science University of Ankara Series A1Mathematics and Statistics, 2019
Summary: In this paper, we define the notions of sequentially Hausdorff Space and full sequentially Hausdorff space. Also we give the relationships between these notions and Hausdorffness.
Akız, Hürmet Fulya, Koçak, Lokman
openaire   +5 more sources

Survey on differential estimators for 3d point clouds

open access: yesComputer 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

The geometric realization of a simplicial Hausdorff space is Hausdorff [PDF]

open access: yesTopology and its Applications, 2013
It is shown that the thin geometric realization of a simplicial Hausdorff space is Hausdorff. This proves a famous claim by Graeme Segal that the thin geometric realisation of a simplicial k-space is a k-space.
openaire   +2 more sources

Fractal dimensions in the Gromov–Hausdorff space

open access: yesBulletin of the Polish Academy of Sciences Mathematics, 2023
In this paper, we first show that for all four non-negative real numbers, there exists a Cantor ultrametric space whose Hausdorff dimension, packing dimension, upper box dimension, and Assouad dimension are equal to given four numbers, respectively. Next, by constructing topological embeddings of an arbitrary compact metrizable space into the Gromov ...
openaire   +2 more sources

Establishing Shape Correspondences: A Survey

open access: yesComputer 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

On the largest Hausdorff compactification of a Hausdorff convergence space [PDF]

open access: yesBulletin of the Australian Mathematical Society, 1977
For a Hausdorff convergence space, necessary and sufficient conditions for its Richardson compactification to be the largest Hausdorff compactification are found and by modifying the convergence structure of the Richardson compactification, it is shown that the largest Hausdorff compactification, whenever it exists, is given by that modified Richardson
openaire   +2 more sources

A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded

open access: yesComputer 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

open access: yesComputer 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

Home - About - Disclaimer - Privacy