:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Yi, Zeping, Wang, Yongjun, Wang, Baoshan, Liu, Songyi
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Computational Geometry
Accesso online:	https://arxiv.org/abs/2602.02570
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An improved boundary-focused adaptive quadtree algorithm for circle-polygon intersection area approximation
di: Yi, Zeping, et al.
Pubblicazione: (2026)

Algorithms for Halfplane Coverage and Related Problems
di: Wang, Haitao, et al.
Pubblicazione: (2024)

Event-based quantum contextuality theory
di: Liu, Songyi, et al.
Pubblicazione: (2024)

Dynamic 3D Convex Hulls Revisited and Applications
di: Wang, Haitao
Pubblicazione: (2026)

On Stable Approximation Algorithms for Geometric Coverage Problems
di: de Berg, Mark, et al.
Pubblicazione: (2024)

An Output Sensitive Algorithm for Discrete Convex Hulls
di: Har-Peled, Sariel
Pubblicazione: (2026)

Dynamic Convex Hulls for Simple Paths
di: Brewer, Bruce, et al.
Pubblicazione: (2024)

Partitioning Regular Polygons into Circular Pieces I: Convex Partitions
di: Damian, Mirela, et al.
Pubblicazione: (2003)

The logical structure of contextuality and nonclassicality
di: Liu, Songyi, et al.
Pubblicazione: (2025)

Coverage Axis++: Efficient Inner Point Selection for 3D Shape Skeletonization
di: Wang, Zimeng, et al.
Pubblicazione: (2024)

The Equivalence between Hardy-type paradox and Logical Contextuality
di: Liu, Songyi, et al.
Pubblicazione: (2026)

Hardy's Paradox for Yu-Oh Set Constructed by Logically Contextual Quantum States
di: He, Chang, et al.
Pubblicazione: (2026)

Atom graph, partial Boolean algebra and quantum contextuality
di: Liu, Songyi, et al.
Pubblicazione: (2024)

Graph structure of quantum mechanics
di: Liu, Songyi, et al.
Pubblicazione: (2024)

On the Line-Separable Unit-Disk Coverage and Related Problems
di: Liu, Gang, et al.
Pubblicazione: (2023)

Convex Polygon Containment: Improving Quadratic to Near Linear Time
di: Chan, Timothy M., et al.
Pubblicazione: (2024)

Approximation Algorithms for Minimum Sum of Moving-Distance and Opening-Costs Target Coverage Problem
di: Zhao, Lei, et al.
Pubblicazione: (2024)

On Line-Separable Weighted Unit-Disk Coverage and Related Problems
di: Liu, Gang, et al.
Pubblicazione: (2024)

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
di: Chan, Timothy M., et al.
Pubblicazione: (2025)

A Polynomial-Time Algorithm for Computing the Exact Convex Hull in High-Dimensional Spaces
di: Zhuang, Qianwei
Pubblicazione: (2025)

Improved Algorithms for Distance Selection and Related Problems
di: Wang, Haitao, et al.
Pubblicazione: (2023)

Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
di: Werner, Peter, et al.
Pubblicazione: (2024)

Finding Closed Quasigeodesics on Convex Polyhedra
di: Demaine, Erik D., et al.
Pubblicazione: (2020)

Engineering Fully Dynamic Convex Hulls
di: van der Hoog, Ivor, et al.
Pubblicazione: (2026)

Efficient Incremental Penetration Depth Estimation between Convex Geometries
di: Gao, Wei
Pubblicazione: (2023)

Shortest Paths on Convex Polyhedral Surfaces
di: Wang, Haitao
Pubblicazione: (2025)

Counting Unit Circular Arc Intersections
di: Wang, Haitao
Pubblicazione: (2026)

Convex Covering Using Collections of Convex Polygons and Set Cover
di: da Fonseca, Guilherme D.
Pubblicazione: (2023)

An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
di: Sukkasem, Phapaengmuang, et al.
Pubblicazione: (2025)

Bicriteria Polygon Aggregation with Arbitrary Shapes
di: Blank, Lotte, et al.
Pubblicazione: (2025)

Equichordal Points of Convex Bodies
di: Jang, Leo, et al.
Pubblicazione: (2025)

Expensive Homeomorphism of Convex Bodies
di: Kim, Donghan
Pubblicazione: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
di: Brewer, Bruce W., et al.
Pubblicazione: (2024)

Efficient Nearest Neighbor Search Using Dynamic Programming
di: Wang, Pengfei, et al.
Pubblicazione: (2024)

Approximation Depth of Convex Polytopes
di: Bakaev, Egor, et al.
Pubblicazione: (2025)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
di: Aichholzer, Oswin, et al.
Pubblicazione: (2025)

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem
di: Zhou, Yi, et al.
Pubblicazione: (2026)

Dominating Set, Independent Set, Discrete $k$-Center, Dispersion, and Related Problems for Planar Points in Convex Position
di: Tkachenko, Anastasiia, et al.
Pubblicazione: (2024)

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
di: Yang, Chao, et al.
Pubblicazione: (2025)

Ipelets for the Convex Polygonal Geometry
di: Parepally, Nithin, et al.
Pubblicazione: (2024)