Results 61 to 70 of about 655,112 (194)
Survey on differential estimators for 3d point clouds
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 efficiency and robustness of grid deformation methods have a significant impact on the entire research process for aerodynamic shape optimization, aeroelastic calculation, and other issues involving updating the flow field calculation grid.
Hao-da WANG +3 more
doaj +1 more source
Quantitative Metrics for Edge Bundling of Network Visualizations
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source
On Bending in the As‐Rigid‐As‐Possible Deformation Energy
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
Texture-Cognition-Based 3D Building Model Generalization
Three-dimensional (3D) building models have been widely used in the fields of urban planning, navigation and virtual geographic environments. These models incorporate many details to address the complexities of urban environments.
Po Liu, Chengming Li, Fei Li
doaj +1 more source
Meshing Unsigned Distance Fields with Regular Triangulations
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
Some properties of k-Delaunay and k-Gabriel graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prosenjit Bose +6 more
openaire +4 more sources
Robust Delaunay graph based mesh movement for adjoint mesh sensitivity
Surface mesh sensitivity in the discrete adjoint framework is efficiently computed using the Delaunay graph method. The method results in an explicit algebraic map between the volume and surface mesh for which the solution of the linear mesh-adjoint ...
Qin, N., Hinchliffe, B., Mura, G.
core +4 more sources
Graph-based description of tertiary lymphoid organs at single-cell level.
Our aim is to complement observer-dependent approaches of immune cell evaluation in microscopy images with reproducible measures for spatial composition of lymphocytic infiltrates.
Nadine S Schaadt +7 more
doaj +1 more source

