:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Yi, Zeping, Wang, Yongjun, Wang, Baoshan, Liu, Songyi
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2602.02570
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Dynamic 3D Convex Hulls Revisited and Applications
by: Wang, Haitao
Published: (2026)

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

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

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

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

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

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

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

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

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

Graph structure of quantum mechanics
by: Liu, Songyi, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

Efficient Incremental Penetration Depth Estimation between Convex Geometries
by: Gao, Wei
Published: (2023)

Shortest Paths on Convex Polyhedral Surfaces
by: Wang, Haitao
Published: (2025)

Counting Unit Circular Arc Intersections
by: Wang, Haitao
Published: (2026)

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

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

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

Equichordal Points of Convex Bodies
by: Jang, Leo, et al.
Published: (2025)

Expensive Homeomorphism of Convex Bodies
by: Kim, Donghan
Published: (2025)

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

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

Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025)

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

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

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

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

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