An algorithm for constructing the aspect graph

摘要: In this paper we present tight bounds on the maximum size of aspect graphs and give worstcase optimal algorithms for their construction, first in convex case then general case. particular, upper lower (including vertex labels) Θ(n3) Θ(n5) constructing graph which run time O(n3) O(n5) cases respectively. The algorithm makes use a new 3D object representation called or asp. We also show different way to label order save factor n asymptotic (at expense retrieval time) both cases, suggest alternatives require less space store more information.