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

Localized

书目名称Discrete and Computational Geometry影响因子(影响力)




书目名称Discrete and Computational Geometry影响因子(影响力)学科排名




书目名称Discrete and Computational Geometry网络公开度




书目名称Discrete and Computational Geometry网络公开度学科排名




书目名称Discrete and Computational Geometry被引频次




书目名称Discrete and Computational Geometry被引频次学科排名




书目名称Discrete and Computational Geometry年度引用




书目名称Discrete and Computational Geometry年度引用学科排名




书目名称Discrete and Computational Geometry读者反馈




书目名称Discrete and Computational Geometry读者反馈学科排名

强制令

The Role of Liver Transplantationotal length. We present an optimal algorithm solving the problem in linear time if the edges incident to . are sorted clockwise by angle. For unsorted edges our algorithm runs in .(. log .) time. For unsorted edges we also give a linear time approximation algorithm and a lower time bound.

烤架

bonnet

Thoracic Aorta and Its Variantsdean rigidity results regarding the existence and combinatorial characterization of expansive motions. In particular, we extend the concept of a pseudo-triangulation from the Euclidean to the spherical case. As a consequence, we formulate a set of . that must be satisfied by three-dimensional generalizations of pointed pseudo-triangulations.

mucous-membrane

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation,known whether it is NP-hard to compute minimum Manhattan networks, i.e. Manhattan networks of minimum total length. In this paper we present a factor-3 approximation algorithm for this problem. Given a set of . nodes, our algorithm takes .(. log .) time and linear space.

含沙射影

含沙射影

A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem,vex pieces. We give a fixed-parameter tractable algorithm for this problem that runs in the following time complexities:.– linear time if . is constant,.– time polynomial in . if .,.or, to be exact, in .(. . . . . 2.) time.

rods366

割让

阴谋

https://doi.org/10.1007/978-981-99-5808-5oves under different assumptions on disk radii and disk placements. For example, with . congruent disks, . moves always suffice for transforming the start configuration into the target configuration; on the other hand, . moves are sometimes necessary.