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

FADE

https://doi.org/10.1007/3-540-54891-2Performance; algorithm; algorithms; artificial intelligence; complexity; computational geometry; intellige

euphoria

網(wǎng)絡添麻煩

狗舍

Notify

An on-line algorithm for constructing sweep planes in regular position,plane 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

身體萌芽

AUGUR

Preclassification and delayed classification of boundary entities in arbitrary dimensions,is preclassification is related to the convex hull on a sphere. This allows an unified approach for very general polyhedra of arbitrary dimensions and for all boundary entities (vertices, edges, faces). It also reduces the time complexity of preclassification in 3D. Replacing preclassification by de

商品

Invigorate

高腳酒杯

Determination of the symmetries of polyhedra and an application to object recognition,ere . 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