activity
20172026
most citedExistence of a Convex Polyhedron with Respect to the Given Radii

3 citations · 5 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CG2026

Apple-Peel Unfolding in Three and Four Dimensions: Spiral and Zonal Selection Rules

Takashi Yoshino, Supanut Chaidee

Apple-Peel Unfolding is a greedy algorithm that selects the faces (or cells) of a polyhedron (or polytope) one at a time in a spiral order, producing a net analogous to peeling an…

cs.CG2026

Apple Peel Unfolding of Archimedean and Catalan Solids

Takashi Yoshino, Supanut Chaidee

We consider a new treatment for making polyhedron nets referred to as ``apple peel unfolding'': drawing the nets as if we were peeling off appleskins. We define apple peel unfoldin…

cs.CG2025

An Algorithm for Illuminating Nonoverlapping Circular Discs' Boundaries on the Plane with Application to Tree Stem Illumination Problem

Phapaengmuang Sukkasem, Supanut Chaidee, Watit Khokthong

Given a set of nonoverlapping circular discs on a plane, we aim to determine possible positions of points (referred to as cameras) that could fully illuminate all the circular…

cs.CG2019★ 3 cited

Existence of a Convex Polyhedron with Respect to the Given Radii

Supanut Chaidee, Kokichi Sugihara

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii…

cs.CG2017★ 2 cited

Recognition of the Spherical Laguerre Voronoi Diagram

Supanut Chaidee, Kokichi Sugihara

In this paper, we construct an algorithm for determining whether a given tessellation on a sphere is a spherical Laguerre Voronoi diagram or not. For spherical Laguerre tessellatio…