Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano Conference proceedings 2003 Springer-Verlag Berlin Heidelb

不可接觸

易于

ARIA

Playing with Triangulations,cting, transforming, and marking triangulations. In various situations, we develop polynomial-time algorithms to determine who wins a given game under optimal play, and to find a winning strategy. Along the way, we show connections to existing combinatorial games such as Kayles.

Vaginismus

Constrained Equitable 3-Cuttings,ector contains 1/3 of each mass). We prove the existence of a continuum of equitable 3-cuttings that satisfy some closure property. This permits us to generalize earlier results on both convex and non-convex equitable 3-cuttings with additional constraints.

討厭

On the Minimum Perimeter Triangle Enclosing a Convex Polygon,sence of a property called the .. This property was crucial in the linear-time solution for the minimum area triangle enclosing a convex polygon. We have discovered a non-trivial interspersing property for the minimum perimeter problem. This resulted in an optimal solution to the minimum perimeter triangle problem.

無(wú)法治愈

不溶解

heckle

Discrete and Computational Geometry978-3-540-44400-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

wangle

0302-9743 Overview: Includes supplementary material: 978-3-540-20776-4978-3-540-44400-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

finite