Results 11 to 20 of about 4,520,879 (281)
Shortest Path Problems on a Polyhedral Surface [PDF]
Algorithmica, 2009 We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface are measured either by the length of a Euclidean shortest path or by link distance. Our main result is a linear-factor speedup for computing all shortest path edge sequences on
Atlas F. Cook IV, Carola Wenk
core +15 more sources
Facility Location on a Polyhedral Surface [PDF]
Discrete and Computational Geometry, 2003 This paper considers the Euclidean 1-center problem on a polyhedral surface: Given an orientable genus-0 polyhedral 2-surface defined by \(n\) triangles, and a set of \(m\) sites on it, identify a location on the surface that minimizes the maximum geodesic distance to the sites.
Boris Aronov +3 more
openaire +6 more sources
Polyhedral Surface: Self-supervised Point Cloud Reconstruction Based on Polyhedral Surface [PDF]
CoRR, 2023 Point cloud reconstruction from raw point cloud has been an important topic in computer graphics for decades, especially due to its high demand in modeling and rendering applications. An important way to solve this problem is establishing a local geometry to fit the local curve.
Hui Tian 0005, Kai Xu 0004
core +5 more sources
Pursuit Evasion on Polyhedral Surfaces [PDF]
Algorithmica, 2013 The authors consider a discrete-time pursuit-evasion game played on the surface of a 3-dimensional polyhedron. Play alternates between a team of pursuers and a single evader. On the pursuers' turn, all pursuers may simultaneously move a distance of up to 1 on the surface; on the evader's turn, they may likewise move up to 1 unit away from their current
Kyle Klein, Subhash Suri
core +6 more sources
Discrete Yamabe Problem for Polyhedral Surfaces
Discrete & Computational Geometry, 2023 AbstractWe study a new discretization of the Gaussian curvature for polyhedral surfaces. This discrete Gaussian curvature is defined on each conical singularity of a polyhedral surface as the quotient of the angle defect and the area of the Voronoi cell corresponding to the singularity.
Kourimska, Hana ; https://orcid.org/
openaire +5 more sources
Reversing a polyhedral surface by origami-deformation [PDF]
European Journal of Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maehara, Hiroshi
openaire +3 more sources
Data-Driven Modeling of Composition-Processing-Microstructure Relations for Recycled Aluminum Cast Alloys. [PDF]
Adv Sci (Weinh)Interpretable machine learning reveals how composition and processing govern the formation and microstructural burden of Fe‐rich intermetallic compounds in recycled Al–Si–Fe–Mn alloys. By separating morphology selection from morphology‐conditioned burden partitioning, this framework shows that identical Fe contents can yield different intermetallic ...
Wang J, Mohammed W, Raabe D.
europepmc +2 more sources
Nanomaterials, 2023 Colloidal assembly of anisotropic particles holds great promise for achieving diverse packing geometries and unique photonic properties. One intriguing candidate for anisotropic self-assembly is colloidal metal-organic frameworks (MOFs), which possess ...
Yuheng He +4 more
doaj +1 more source
Visual smoothness of polyhedral surfaces [PDF]
ACM Transactions on Graphics, 2019 Representing smooth geometric shapes by polyhedral meshes can be quite difficult in situations where the variation of edges and face normals is prominently visible. Especially problematic are saddle-shaped areas of the mesh, where typical vertices with six incident edges are ill suited to emulate the more symmetric smooth situation. The importance of a
Davide Pellis +4 more
openaire +2 more sources
Rigidity of polyhedral surfaces, II [PDF]
Geometry & Topology, 2009 37 pages, 23 ...
Guo, Ren, Luo, Feng
openaire +3 more sources