In this paper, we propose a new shape feature for shapesimilarity search of 3D polygonal-mesh models in digital museum. The shape feature is an extension of the D2 shape functions proposed by Osada. Our proposed shape feature is a combination of geometry and texture which is also invariant to similarity transformation. Experiments showed that, our method achieved better performance improvement ...

In this paper, we consider the case of a robot that must find ways in an initially unknown and often complex cross-country environment. Our approach relies on a particular model of the environment, built from 3D data : the environment is represented by a hierarchical polygonal structure, in which terrain classes probabilities are updated as the robot moves. We describe how to define traversabil...

Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is pie...

Consider a planar linkage, consisting of disjoint polygonal arcs and cycles of rigid bars joined at incident endpoints (polygonal chains), with the property that no cycle surrounds another arc or cycle. We prove that the linkage can be continuously moved so that the arcs become straight, the cycles become convex, and no bars cross while preserving the bar lengths. Furthermore, our motion is pie...

We propose the Cross Scanline Buffer which preserves the result of hidden surface removal as performed by the Cross Scanline Algorithm. The Cross Scan Buffer reduces image re-generation time and eliminates aliasing artifacts even if the image is arbitrarily scaled. Perfect anti-aliasing is achieved because the Cross Scanline Algorithm analytically determines visible polygonal surfaces and divid...

In this paper we study the separability in the plane by two criteria: double-wedge separability and Θ-separability. We give an O(N logN)-time optimal algorithm for computing all the vertices of separating double wedges of two disjoint sets of objects (points, segments, polygons and circles) and an O((N/Θ0) logN)-time algorithm for computing a nearly-straight minimal Θ-polygonal chain separating...

The polygonal lines traditionally used in parallel coordinates have two substantial limitations. First, they possess only C0 continuity, which causes the “cross-over” problem. Second, for large datasets, the lines become cluttered, obscuring inherent structure in the data. We introduce a model for curve bundles in parallel-coordinates plots to overcome these problems. The C0 polygonal lines are...