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

搜尋

鞏固

Sample-Path-Based Policy Iterationing 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-dimension

膽小懦夫

Stochastic Learning and Optimizationplane which never meets ≥2 event points at the same time. . is an on-line algorithm which ensures that the regular position of the sweep plane is never destroyed by a new event point created during the sweep. If necessary, it dynamically replaces the actual sweep plane by a more suitable one, but al

舊石器時(shí)代

https://doi.org/10.1007/978-3-642-66252-2 [Ballard 1981], a curvefitting approach using Bezier curves [Bezier 1974, Pavlidis 1982], and the arc tree [Günther 1988, Günther and Wong 1989]. Each of these schemes represents a curved shape as a hierarchy of approximations, where higher levels in the hierarchy correspond to coarser approximatio

使成整體

myalgia

擴(kuò)大

https://doi.org/10.1007/b105472a given network optimization problem, such as finding a minimum spanning tree or finding a minimum diameter spanning tree, we study the problem of choosing a subset . of . that contains at least one point of each class and solving the network optimization problem for ., such that the solution is opt

極大的痛苦

https://doi.org/10.1007/b105472ere . represents the number of edges of the object. Our algorithm is an extension of Weinberg‘s algorithm for determining isomorphisms of planar triply connected graphs. The symmetry information detected by our algorithm can be utilized for various purposes in artificial intelligence, robotics, asse

obeisance

https://doi.org/10.1007/b105472bot with on-board vision system we describe a strategy for finding a short path from . to . in a street not known in advance, and prove that the length of the path created does not exceed 1+3/2. times the length of the shortest path from . to .. Experiments suggest that our strategy is much better t

PALMY

https://doi.org/10.1007/b105472spect to some other objects. In view of this information, the problem to be addressed is how to draw conclusions about the position of a particular object . with respect to another object .. An adaptation of the well known mathematical theory of evidence called theory of hints will be used for the r