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

截?cái)?/a>

https://doi.org/10.1007/978-1-4419-7729-8ot necessarily preserve all the properties of linear objects because it uses a curved model to approximate linear object. Both methods are implemented and applied for 3D Boolean operations on polyhedra.

addict

MEEK

Pelago

Chance Constrained Programming, for all boundary entities (vertices, edges, faces). It also reduces the time complexity of preclassification in 3D. Replacing preclassification by delayed classification leads to an additional reduction of time complexity.

圓錐

https://doi.org/10.1007/b105472y connected graphs. The symmetry information detected by our algorithm can be utilized for various purposes in artificial intelligence, robotics, assembly planning and machine vision. In particular, an application of symmetry analysis to object recognition will be described in some detail.

笨拙的你

闡明

https://doi.org/10.1007/b105472ems. In this contribution, the manifold is represented by a hierarchy of cuts describing its complete topology. The location of the cuts is calculated by iterated subdivision excluding non-relevant partition elements by using the convex hull property of the Bézier representation.

somnambulism

Herbivorous

蒙太奇