10486430
Reconstructing Surfaces and Functions on Surfaces from Unorganized Three-Dimensional Data
Abstract. Creating a computer model from an existing part is a common problem in reverse engineering. The part might be scanned with a device like the laser range scanner, or points might be measured on its surface with a mechanical probe. Sometimes, not only the spatial location of points, but also some associated physical property can be measured. The problem of automatically reconstructing from this data a topologically consistent and geometrically accurate model of the object and of the sampled scalar field is the subject of this paper. The proposed algorithm can deal with connected, orientable manifolds of unrestricted topological type, given a sufficiently dense and uniform sampling of the object's surface. It is capable of automatically reconstructing both the model and a scalar field over its surface. It uses Delaunay triangulations, Voronoi diagrams, and α-shapes for efficiency of computation and theoretical soundness. It generates a representation of the surface and the field based on Bernstein—Bézier polynomials, with the surface modeled by implicit patches (A-patches), that are guaranteed to be smooth and single-sheeted.
6581626
Spline Approximations of Real Algebraic Surfaces
We use a combination of both symbolic and numerical techniques to construct several degree boundedG0andG1continuous, piecewise spline approximations of real implicit algebraic surfaces for both computer graphics and geometric modeling. These approximations are based upon an adaptive triangulation (aG0planar approximation) of the real components of the algebraic surface, and include both singular points and singular curves on the surface. A curvilinear wireframe is also constructed using minimum bending energy, parametric curves with additionally normals varying along them. The spline approximations over the triangulation or curvilinear wireframe could be one of several forms: either low degree, implicit algebraic splines (triangular A-patches) or multivariate functional B-splines (B-patches) or standardized rational Bernstein?Bezier patches (RBB), or triangular rational B-Splines. The adaptive triangulation is additionally useful for a rapid display and animation of the implicit surface.
10302711
Fast evaluation of the improved Loop's subdivision surfaces
For obtaining better curvature distributions of subdivision surfaces, various improvements for Loop's subdivision scheme (C. Loop, 1987) on triangular surface meshes have been made. A careful analysis shows that the fast evaluation technique of the subdivision surface proposed by Stam is no longer usable to these improved schemes. This paper describes a fast evaluating algorithm for improved Loop's subdivision surfaces. The algorithm is applicable to a vast class of subdivision schemes for triangular surface meshes. Using the proposed algorithm, one can evaluate the subdivision surface at any domain point for any set of input subdivision masks and a control mesh.
5553082
Smooth Shell Construction with Mixed Prism Fat Surfaces
Several naturally occurring as well as manufactured objects have shell like structures, that is their boundaries consist of surfaces with thickness. In an earlier paper, we have provided a reconstruction algorithm for such shell structures using smooth fat surfaces within three-sided prisms. In this paper, we extend the approach to a scaffolding consisting of three and four-sided prisms. Within each prism the constructed function is converted to a spline representation. In addition to the adaptive feature of our earlier scheme, the new scheme has the following extensions: (a) four sided fat patches are employed; (b) the size of individual fat patches are bigger; (c) fairing techniques are combined to obtain nicely shaped fat surfaces.
14317717
Directional smoothing of triangular meshes
In this paper, we propose a so-called directional smoothing method based mean curvature flow. The selection of the diffusion direction is based on the descent of some energy functional. We show that the directional diffusion flow is volume-preserving. Based on the local directional diffusion flow, we present a feature-preserving smoothing method. Finally, we provide a series of examples to graphically demonstrate the quality of our results.
2318262
Automatic reconstruction of surfaces and scalar fields from 3D scans
We present an efficient and uniform approach for the automatic reconstruction of surfaces of CAD (computer aided design) models and scalar fields defined on them, from an unorganized collection of scanned point data. A possible application is the rapid computer model reconstruction of an existing part or prototype from a three dimensional (3D) points scan of its surface. Color, texture or some scalar material property of the physical part, define natural scalar fields over the surface of the CAD model. Our reconstruction algorithm does not impose any convexity or differentiability restrictions on the surface of the original physical part or the scalar field function, except that it assumes that there is a sufficient sampling of the input point data to unambiguously reconstruct the CAD model. Compared to earlier methods our algorithm has the advantages of simplicity, efficiency and uniformity (both CAD model and scalar field reconstruction). The simplicity and efficiency of our approach is based on several novel uses of appropriate sub-structures (alpha shapes) of a three-dimensional Delaunay Triangulation, its dual the three-dimensional Voronoi diagram, and dual uses of trivariate Bernstein-Bezier forms. The boundary of the CAD model is modeled using implicit cubic Bernstein-Bezier patches, while the scalar field is reconstructed with functional cubic Bernstein-Bezier patches. CR
34660993
Three-dimensional animated face modeling from stereo video
3D modeling of human face has been an active research topic in computer vision and computer graphics communities. In this paper we develop a face-modeling system from calibrated stereo video input. The stereo configuration is chosen according to the characteristics of the face structure. For data capturing the subject sits in front of the calibrated stereo video cameras and rotates his/her head from front view to side view. Then we can create his/her 3D face model with realistic texture mapped, which is ready for MPEG-4 compatible facial animation, by adapting a generic wireframe model to the input. In deciding 3D face geometry we utilize two kinds of 2D information. One is the correspondence between stereo pair; the other is self-occluded contour. After some 3D points in the specific face are obtained from both image clues in different frames, RBF (Radius Basis Function) data interpolation is performed to decide its shape. Afterwards texture image is generated from the face geometry and video. Experiments show that satisfactory results can be reached with our system.
30893886
Delay Defect Characterization Using Low Voltage Test
For nanometer designs, many subtle defects lead to excessive delays in signal paths that cause reliability concerns. Traditional test-based diagnosis methods can only identify the failing nodes without the capability to tell the defect nature behind the observed delay faults. This differentiation is important for gathering accurate defect statistics for process improvement during yield ramp-up. In this paper we presented an effective delay defect analysis methodology that can quickly categorize the delay defects into either transistor related defects or resistive interconnect defects. The new delay defect/failure characterization method is based on low voltage test and delay defect detection in slack interval (DDSI) method. Experimental results were presented to validate the effectiveness of the new method. Practical considerations were also addressed for adoption of the methodology.
14215306
Hidden Markov Model Based Events Detection in Soccer Video
This paper presents an algorithm developed based on hidden Markov model for cues fusion and event inference in soccer video. Four events, shoot, foul, offside and normal playing, are defined to be detected. The states of the events are employed to model the observations of the five cues, which are extracted from the shot sequences directly. The experimental results show the algorithm is effective and robust in inferring events from roughly extracted cues.
349681
Smart Remote Classroom: Creating a Revolutionary Real-Time Interactive Distance Learning System
Real-time interactive virtual classroom is an important type of distance learning. However currently available systems are insufficient in the support of large-scale user access, and neither can they accommodate accessing with heterogeneous devices and networks. Furthermore, these systems are usually desktop-based, which results that the teachers' experience is completely different from teaching in a real classroom. The Smart Remote Classroom project tackles these difficulties through the development of the following technologies: 1) A hybrid application-layer Multicast protocol called TORM and an Adaptive Content Delivery scheme called AMTM. Together they enable large-scale users to access a virtual classroom with different devices and networks at the same time. 2) A dedicated software called SameView, which take use of the proposed TORM and AMTM technology and provide a rich set of functions for teachers and students to efficiently carry out the real-time interactive distance learning. Moreover, SameView can record the whole process of a class into a compound multimedia document for later retrieval and review of the class. 3) An augmented classroom called Smart Classroom, where the user interface of the SameView for the teacher are distributed in and fused with the room space. Thus the teacher can instruct the remote students just like teaching face-to-face in a conventional classroom. All these technologies has been successfully integrated and demonstrated in the prototype system.
205481438
Acyclic domination on bipartite permutation graphs
For a graph G = (V, E), a subset S ⊆ V is called an acyclic dominating set of G if every vertex in V - S is adjacent to at least one vertex in S and the subgraph induced by S contains no cycles. In this paper, we present a linear time algorithm for transforming a minimum dominating set in a bipartite permutation graph into a minimum acyclic dominating set. Chao et al. gave a linear time algorithm to find a minimum dominating set of a permutation graph. Thus, we show that the acyclic domination problem is linear time solvable for bipartite permutation graphs.