Guardado en:
| Autores principales: | Chaidee, Supanut, Sugihara, Kokichi |
|---|---|
| Formato: | Preprint |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/1906.07919 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Apple-Peel Unfolding in Three and Four Dimensions: Spiral and Zonal Selection Rules
por: Yoshino, Takashi, et al.
Publicado: (2026)
por: Yoshino, Takashi, et al.
Publicado: (2026)
An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
por: Sukkasem, Phapaengmuang, et al.
Publicado: (2025)
por: Sukkasem, Phapaengmuang, et al.
Publicado: (2025)
Apple Peel Unfolding of Archimedean and Catalan Solids
por: Yoshino, Takashi, et al.
Publicado: (2026)
por: Yoshino, Takashi, et al.
Publicado: (2026)
Online Hitting Sets for Disks of Bounded Radii
por: De, Minati, et al.
Publicado: (2024)
por: De, Minati, et al.
Publicado: (2024)
FPT Constant Approximation Algorithms for Colorful Sum of Radii
por: Liu, Shuilian, et al.
Publicado: (2025)
por: Liu, Shuilian, et al.
Publicado: (2025)
Clustering with Few Disks to Minimize the Sum of Radii
por: Abrahamsen, Mikkel, et al.
Publicado: (2023)
por: Abrahamsen, Mikkel, et al.
Publicado: (2023)
FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
por: Bandyapadhyay, Sayan, et al.
Publicado: (2023)
por: Bandyapadhyay, Sayan, et al.
Publicado: (2023)
FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
por: Grandoni, Fabrizio, et al.
Publicado: (2026)
por: Grandoni, Fabrizio, et al.
Publicado: (2026)
Finding Closed Quasigeodesics on Convex Polyhedra
por: Demaine, Erik D., et al.
Publicado: (2020)
por: Demaine, Erik D., et al.
Publicado: (2020)
Constrained Level Planarity is FPT with Respect to the Vertex Cover Number
por: Klemz, Boris, et al.
Publicado: (2024)
por: Klemz, Boris, et al.
Publicado: (2024)
Revisiting Graph Modification via Disk Scaling: From One Radius to Interval-Based Radii
por: Depian, Thomas, et al.
Publicado: (2026)
por: Depian, Thomas, et al.
Publicado: (2026)
Convex Covering Using Collections of Convex Polygons and Set Cover
por: da Fonseca, Guilherme D.
Publicado: (2023)
por: da Fonseca, Guilherme D.
Publicado: (2023)
Equichordal Points of Convex Bodies
por: Jang, Leo, et al.
Publicado: (2025)
por: Jang, Leo, et al.
Publicado: (2025)
Expensive Homeomorphism of Convex Bodies
por: Kim, Donghan
Publicado: (2025)
por: Kim, Donghan
Publicado: (2025)
Stabbing Faces By a Convex Curve
por: Eppstein, David
Publicado: (2025)
por: Eppstein, David
Publicado: (2025)
A Simple Proof of the Existence of a Planar Separator
por: Har-Peled, Sariel
Publicado: (2011)
por: Har-Peled, Sariel
Publicado: (2011)
Approximation Depth of Convex Polytopes
por: Bakaev, Egor, et al.
Publicado: (2025)
por: Bakaev, Egor, et al.
Publicado: (2025)
Computing Planar Convex Hulls with a Promise
por: Aghamolaei, Sepideh, et al.
Publicado: (2026)
por: Aghamolaei, Sepideh, et al.
Publicado: (2026)
Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
por: Yang, Chao, et al.
Publicado: (2025)
por: Yang, Chao, et al.
Publicado: (2025)
Proof of Dudley's Convex Approximation
por: Har-Peled, Sariel, et al.
Publicado: (2019)
por: Har-Peled, Sariel, et al.
Publicado: (2019)
Ipelets for the Convex Polygonal Geometry
por: Parepally, Nithin, et al.
Publicado: (2024)
por: Parepally, Nithin, et al.
Publicado: (2024)
Local Routing on a Convex Polytope in R^3
por: Chandran, Sreehari, et al.
Publicado: (2025)
por: Chandran, Sreehari, et al.
Publicado: (2025)
Instance-Optimal Imprecise Convex Hull
por: de Berg, Sarita, et al.
Publicado: (2025)
por: de Berg, Sarita, et al.
Publicado: (2025)
Practical Insertion-Only Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)
por: van der Hoog, Ivor, et al.
Publicado: (2025)
Preprocessing Disks for Convex Hulls, Revisited
por: Löffler, Maarten, et al.
Publicado: (2025)
por: Löffler, Maarten, et al.
Publicado: (2025)
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
por: Filtser, Omrit, et al.
Publicado: (2026)
por: Filtser, Omrit, et al.
Publicado: (2026)
Realizing Metric Spaces with Convex Obstacles
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)
In search of the Giant Convex Quadrilateral hidden in the Mountains
por: Ghosh, Nandana, et al.
Publicado: (2025)
por: Ghosh, Nandana, et al.
Publicado: (2025)
Approximating Convex Hulls via Range Queries
por: Schibler, T., et al.
Publicado: (2026)
por: Schibler, T., et al.
Publicado: (2026)
An Output Sensitive Algorithm for Discrete Convex Hulls
por: Har-Peled, Sariel
Publicado: (2026)
por: Har-Peled, Sariel
Publicado: (2026)
On Compaction and Realizability of Almost Convex Octilinear Representations
por: Förster, Henry, et al.
Publicado: (2025)
por: Förster, Henry, et al.
Publicado: (2025)
Convexity Helps Iterated Search in 3D
por: Afshani, Peyman, et al.
Publicado: (2025)
por: Afshani, Peyman, et al.
Publicado: (2025)
A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)
por: van der Hoog, Ivor, et al.
Publicado: (2025)
An Overview of Minimum Convex Cover and Maximum Hidden Set
por: Browne, Reilly
Publicado: (2024)
por: Browne, Reilly
Publicado: (2024)
Dynamic 3D Convex Hulls Revisited and Applications
por: Wang, Haitao
Publicado: (2026)
por: Wang, Haitao
Publicado: (2026)
Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
por: de Berg, Mark, et al.
Publicado: (2026)
por: de Berg, Mark, et al.
Publicado: (2026)
Fast Area-Weighted Peeling of Convex Hulls for Outlier Detection
por: Sridhar, Vinesh, et al.
Publicado: (2024)
por: Sridhar, Vinesh, et al.
Publicado: (2024)
Convex Polygon Containment: Improving Quadratic to Near Linear Time
por: Chan, Timothy M., et al.
Publicado: (2024)
por: Chan, Timothy M., et al.
Publicado: (2024)
Tumbling Downhill along a Given Curve
por: Eckmann, Jean-Pierre, et al.
Publicado: (2024)
por: Eckmann, Jean-Pierre, et al.
Publicado: (2024)
Ejemplares similares
-
Apple-Peel Unfolding in Three and Four Dimensions: Spiral and Zonal Selection Rules
por: Yoshino, Takashi, et al.
Publicado: (2026) -
An Algorithm for Illuminating $n$ Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem
por: Sukkasem, Phapaengmuang, et al.
Publicado: (2025) -
Apple Peel Unfolding of Archimedean and Catalan Solids
por: Yoshino, Takashi, et al.
Publicado: (2026) -
Online Hitting Sets for Disks of Bounded Radii
por: De, Minati, et al.
Publicado: (2024) -
FPT Constant Approximation Algorithms for Colorful Sum of Radii
por: Liu, Shuilian, et al.
Publicado: (2025)