Results 31 to 40 of about 5,659 (189)

Laminations and groups of homeomorphisms of the circle

open access: yes, 2002
If M is an atoroidal 3-manifold with a taut foliation, Thurston showed that pi_1(M) acts on a circle. Here, we show that some other classes of essential laminations also give rise to actions on circles.
Calegari, Danny, Dunfield, Nathan M.
core   +1 more source

3D‐Printing Aided Rapid Prototyping of Pretensioned Tensegrity Structures for Robotic Applications

open access: yesAdvanced Robotics Research, EarlyView.
Printing, injection molding, and assembly (PMA) is a method for rapid prototyping mesoscale, topologically complex, and tensioned tensegrity structures. In combination with PMA method, two mold design strategies: modular mold and compact channel layout, enable efficiency and scalability for tensegrity fabrication.
Yi Sun   +3 more
wiley   +1 more source

Circular-Arc Cartograms

open access: yes, 2012
We present a new circular-arc cartogram model in which countries are drawn as polygons with circular arcs instead of straight-line segments. Given a political map and values associated with each country in the map, a cartogram is a distorted map in which
Kobourov, Stephen G.   +2 more
core   +2 more sources

Computer Vision Pipeline for Image Analysis for Freeze‐Fracture Electron Microscopy: Rosette Cellulose Synthase Complexes Case

open access: yesAdvanced Intelligent Discovery, EarlyView.
This paper presents a computer vision (deep learning) pipeline integrating YOLOv8 and YOLOv9 for automated detection, segmentation, and analysis of rosette cellulose synthase complexes in freeze‐fracture electron microscopy images. The study explores curated dataset expansion for model improvement and highlights pipeline accuracy, speed ...
Siri Mudunuri   +6 more
wiley   +1 more source

Minkowski Sums of Monotone and General Simple Polygons [PDF]

open access: yesDiscrete & Computational Geometry, 2005
Let P be a simple polygon with m edges, which is the disjoint union of k simple polygons, all monotone in a common direction u, and let Q be another simple polygon with n edges, which is the disjoint union of l simple polygons, all monotone in a common direction v. We show that the combinatorial complexity of the Minkowski sum P ź Q is O(klmnź(min{m,n})
Eduard Oks, Micha Sharir
openaire   +1 more source

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real‐World Data

open access: yesAdvanced Intelligent Discovery, EarlyView.
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley   +1 more source

Convexifying Monotone Polygons while Maintaining Internal Visibility [PDF]

open access: yes, 2012
Let P be a simple polygon on the plane. Two vertices of P are visible if the open line segment joining them is contained in the interior of P. In this paper we study the following questions posed in [8,9]: (1) Is it true that every non-convex simple polygon has a vertex that can be continuously moved such that during the process no vertex-vertex ...
Oswin Aichholzer   +5 more
openaire   +1 more source

Any Monotone Function Is Realized by Interlocked Polygons [PDF]

open access: yesAlgorithms, 2012
Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked).
Demaine, Erik D.   +2 more
openaire   +4 more sources

PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM

open access: yesKhulna University Studies, 2022
In the field of computational geometry, pseudo-triangulation of a polygon is an interesting topic. Breaking a polygon into pseudo-triangles reduces the calculation cost and increases computational power. The sweep line algorithm also known as the plane sweep algorithm uses an imaginary line or a plain surface on the Euclidean plain to perform various ...
S.M. Azoad Ahnaf   +2 more
openaire   +1 more source

Study on the Fragmentation Characteristics and Dust Generation Mechanism of Coal Cutting by Pick

open access: yesAsia-Pacific Journal of Chemical Engineering, EarlyView.
ABSTRACT During underground excavation, coal dust generation threatens miners' health and damages ecosystems. Its generation is directly influenced by cutting pick performance and inherent coal properties. This study investigates the effects of coal properties and cutting parameters on coal fragmentation characteristics from a mesoscopic perspective ...
Shihang Li   +10 more
wiley   +1 more source

Home - About - Disclaimer - Privacy