Results 11 to 20 of about 1,002,963 (278)
Shortest paths on polyhedral surfaces and terrains [PDF]
Proceedings of the forty-sixth annual ACM symposium on Theory of computing, 2014 We present an algorithm for computing shortest paths on polyhedral surfaces under convex distance functions. Let n be the total number of vertices, edges and faces of the surface. Our algorithm can be used to compute L1 and L∞ shortest paths on a polyhedral surface in O(n2 log4 n) time.
Siu-Wing Cheng, Jiongxin Jin
openaire +3 more sources
A note on the polynomial approximation of vertex singularities in the boundary element method in three dimensions [PDF]
, 2008 We study polynomial approximations of vertex singularities of the type $r^\lambda |\log r|^\beta$ on three-dimensional surfaces. The analysis focuses on the case when $\lambda > -\frac 12$.
Bespalov, A
core +7 more sources
Designing a data structure for polyhedral surfaces [PDF]
Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98, 1998 Design solutions for a program library are presented for combinatorial data structures in computational geometry such as planar maps and polyhedral sur faces Design issues considered are genericity exibility time and space eciency and easeofuse We focus on topological aspects of polyhedral surfaces Edge based representations for polyhedrons are ...
Lutz Kettner, Kettner, Lutz
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
Dimple-Encoded Reprogrammable Origami. [PDF]
Adv Sci (Weinh)Local snap‐through of bistable dimples turns flat elastic sheets into reprogrammable origami structures. Interaction‐guided dimple arrays act as angle‐programmable hinge bands, enabling one sheet to morph into distinct polygonal and three‐dimensional configurations while retaining stable shapes for deployable and protective functions.
Zhang Q +6 more
europepmc +2 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 +4 more sources
A new Euler's formula for DNA polyhedra. [PDF]
PLoS ONE, 2011 DNA polyhedra are cage-like architectures based on interlocked and interlinked DNA strands. We propose a formula which unites the basic features of these entangled structures.
Guang Hu, Wen-Yuan Qiu, Arnout Ceulemans
doaj +1 more source
Polyhedral surface decomposition with applications [PDF]
Computers & Graphics, 2002 Abstract This paper addresses the problem of decomposing a polyhedral surface into “meaningful” patches. We describe two decomposition algorithms—flooding convex decomposition and watershed decomposition, and show experimental results. Moreover, we discuss three applications which can highly benefit from surface decomposition.
Emanuel Zuckerberger +2 more
openaire +1 more source
COMBINING 3D VOLUME AND MESH MODELS FOR REPRESENTING COMPLICATED HERITAGE BUILDINGS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017 This study developed a simple but effective strategy to combine 3D volume and mesh models for representing complicated heritage buildings and structures.
F. Tsai, F. Tsai, H. Chang, Y.-W. Lin
doaj +1 more source
Superbalance of holographic entropy inequalities
Journal of High Energy Physics, 2020 The domain of allowed von Neumann entropies of a holographic field theory carves out a polyhedral cone — the holographic entropy cone — in entropy space. Such polyhedral cones are characterized by their extreme rays.
Temple He +2 more
doaj +1 more source