Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2001 Springer-Verla

旧石器时代

保守党

Creatinine-Test

On the Number of Views of Polyhedral Scenes, we close these gaps by improving the lower bounds. We construct an example of a scene .(....) orthographic views, and another with .(....) perspective views. Our construction can also be used to improve the known lower bounds for the number of silhouette views and for the number of distinct views from a viewpoint moving along a straight line.

Bridle

Electrolysis

LAY

NATAL

Handedness

On double bound graphs with respect to graph operationsons. For example, The Cartesian product . × . of two graphs . and . is a DB-graph if and only if both . and . are bipartite graphs, the corona . º . of two graphs . and . is a DB-graph if and only if . is a bipartite graph and . is a UB-graph, and the middle graph . of a graph . is a DB-graph if and only if . is an even cycle or a path, etc.

CLAMP

On Paths in a Complete Bipartite Geometric Graphtraight-line segment. We prove that (i) If |. (. + 1)(2. - 4)+1, then the geometric complete bipartite graph . contains a path that passes through all the points in . and has no crossings; and (ii) There exists a configuration of . ∪ . with . such that in . every path containing the set . has at least one crossing.

SENT