Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Xuehou Tan Conference proceedings 2005 Springer-Verlag Ber

CUMB

Calibrate

Adjuvant and Neoadjuvant TherapiesLet . (., .) be the smallest integer such that any set of . (., .) points in the plane, no three collinear, contains both an empty convex . -gon and an empty convex . -gon, which do not intersect. We show that . (3,5) = 10, 12 ≤ . (4,5) ≤ 14, 16 ≤ . (5,5) ≤ 20.

Psa617

I/O-Efficiently Pruning Dense Spanners,Given a geometric graph .=(.,.) in . with constant dilation ., and a positive constant ., we show how to construct a (1 + .)-spanner of . with . edges using . I/O operations.

admission

On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons,Let . (., .) be the smallest integer such that any set of . (., .) points in the plane, no three collinear, contains both an empty convex . -gon and an empty convex . -gon, which do not intersect. We show that . (3,5) = 10, 12 ≤ . (4,5) ≤ 14, 16 ≤ . (5,5) ≤ 20.

两栖动物

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/281180.jpg

saturated-fat

贪婪性

Notify

Grid Vertex-Unfolding Orthostacks,ectured that orthostacks could be unfolded using cuts that lie in a plane orthogonal to a coordinate axis and containing a vertex of the orthostack. We prove the existence of a vertex-unfolding using only such cuts.

pulmonary-edema

Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon,alent. This paper extends the result on edge-capacitated graphs, where the capacities are real numbers, and it presents a proof of the equivalence of the three relations. From this proof, it is also shown that we can determine whether or not a given graph precedes another given graph in polynomial time.

红肿