Titlebook: Discrete and Computational Geometry and Graphs; 16th Japanese Confer Jin Akiyama,Hiro Ito,Toshinori Sakai Conference proceedings 2014 Sprin

同謀

Projection

Computational Geometry in the Human Brain,ble to manage a huge amount of visual data, can understand the scenes in front of them, and thus can survive in their daily lives. We use visual illusions to investigate how the human brain treats geometric data, and we point out the similarities between the robustness of human geometric processing

鞠躬

A Characterization of Link-2 LR-visibility Polygons with Applications,gon . is ... if there are two points ., . on the boundary of . such that every point on the clockwise boundary of . from . to . is link-2 visible from some point of the other boundary of . from . to . and vice versa. We give a characterization of link-2 .-visibility polygons by generalizing the know

MARS

More Results on Clique-chromatic Numbers of Graphs with No Long Path,nochromatic. In 2003, Gravier, Hoang, and Maffray have shown that, for any graph ., the class of .-free graphs has a bounded clique-chromatic number if and only if . is a vertex-disjoint union of paths, and they give an upper bound for all such cases. In this paper, their bounds for . and . with . a

雜色

Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plic spanning tree with maximum degree at most . on .. Moreover, we show the existence of a non-crossing properly colored geometric perfect matching in the plane lattice. In order to prove these our results, we propose an useful lemma that gives a good partition of a sequence of multicolored points.

集聚成團(tuán)

壟斷

inflame

More Results on Clique-chromatic Numbers of Graphs with No Long Path,f and only if . is a vertex-disjoint union of paths, and they give an upper bound for all such cases. In this paper, their bounds for . and . with . are significantly reduced to . and . respectively, and sharp bounds are given for some subclasses.

Accolade

occurrence