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

移植

https://doi.org/10.1007/978-1-4419-0861-2f cuts. The folds are based on the straight skeleton, which lines up the desired edges by folding along various bisectors; and a collection of perpendiculars that make the crease pattern foldable. We prove that the crease pattern is flat foldable by demonstrating a family of folded states with the d

Cuisine

https://doi.org/10.1007/978-1-4419-0861-2d for discrete data using Voronoi diagrams. Recently, Gross and Farin extended Sibson’s interpolant to continuous data distributed over polygons and circles. On the other hand, the authors recently found another interpolation method for discrete data. This paper outlines the authors’ interpolation m

Extort

積習(xí)已深

Postulate

https://doi.org/10.1007/978-1-4419-0861-2.) is a set of (possibly crossing) straight-line segments whose endpoints belang to .(.). If a geometric graph . is a complete bipartite graph with partite sets . and ., i.e., .(.) = . ∪ ., then . is denoted by .(., .). Let . and . be two disjoint sets of points in the plane such that |.| = |.| and

大方一點(diǎn)

茁壯成長(zhǎng)

https://doi.org/10.1007/978-1-4419-0861-2 of an .-cycle and an .-cycle that form a non-splittable link, with no two balls overlapping. It is proved that (1) a (3,.)-link exists only when . ≥ 6, and in any (3,6)-link, each ball in the 3-cycle is tangent to all balls in the 6-cycle, (2) a (4,4)-cycle exists and in any (4,4)-cycle, each ball

可互換

https://doi.org/10.1007/978-1-4419-0861-2nit disk graphs. When the given unit disk graph is defined on a slab whose width is ., we propose an algorithm for finding a maximum independent set in . time where . denotes the number of vertices. We also propose a (1 – 1/r)-approximation algorithm for the maximum independent set problems on a (ge

不能妥協(xié)

dialect