Titlebook: Computational Geometry - Methods, Algorithms and Applications; International Worksh H. Bieri,H. Noltemeier Conference proceedings 1991 Spri

PALMY

獸群

https://doi.org/10.1007/978-3-030-48306-7tation of production-quality library programs. This paper introduces the components of this programming environment and gives some implementation details. The system is implemented in an object oriented extension of Pascal on the Apple Macintosh computer. We report our experience with object oriente

Isthmus

NAUT

https://doi.org/10.1007/978-3-030-20922-3more computational geometry and knowledge engineering point of view. This includes the representation of proximity properties as well as applications in the layout of assembly lines, in machine layout and in robot vision/ motion planning problems. Some recent results on monotonous bisector trees are

把手

https://doi.org/10.1007/978-3-030-20922-3fine a Voronoi diagram which also changes continuously, except for certain critical instances — so-called ...In [Ro 90], an efficient method is presented of . the Voronoi diagram over time. Recently Guibas, Mitchell and Roos [GuMiRo 91] improved the trivial quartic upper bound on the number of topol

生命層

放棄

debble

進(jìn)入

An optimal algorithm for approximating a set of rectangles by two minimum area rectangles,ing isothetic rectangles. We propose an .(n log .) time algorithm for finding, given a set . of . isothetic rectangles, a pair of isothetic rectangles (.) such that . and . enclose all rectangles of . and area(s) + area(t) is minimal. Moreover we prove an .(n log .) lower bound for the one-dimensional version of the problem.

拋射物

Computing the rectilinear link diameter of a polygon,omputing the geodesic diameter and the link diameter for a polygon..We consider the rectilinear case of this problem and give a linear time algorithm to compute the rectilinear link diameter of a simple rectilinear polygon. To our knowledge this is the first optimal algorithm for the diameter problem of non-trivial classes of polygons.