• Title/Summary/Keyword: surface representation

Search Result 337, Processing Time 0.031 seconds

3D Surface Representation and Manipulation Scheme for Web-based 3D Geo-Processing

  • Choe, Seung-Keol;Kim, Kyong-Ho;Lee, Jong-Hun;Yang, Young-Kyu
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 1999.12a
    • /
    • pp.66-71
    • /
    • 1999
  • For given 3D geographic data which is usually of DEM(Data Elevation Model) format, we have to represent and manipulate the data in various ways. For example, we have to draw a part of them in drawing canvas. To do this we give users a way of selecting area they want to visualize. And we have to give a base tool for users to select the local area which can be chosen for some geographic operation. In this paper, we propose a 3D data processing method for representation and manipulation. The method utilizes the major properties of DEM and TIN(Triangular Irregular Network), respectively. Furthermore, by approximating DEM with a TIN of an appropriate resolution, we can support a fast and realistic surface modeling. We implement the structure with the following 4 level stages. The first is an optimal resolution of DEM which represent all of wide range of geographic data. The second is the full resolution DEM which is a subarea of original data generated by user's selection in our implemeatation. The third is the TIN approximation of this data with a proper resolution determined by the relative position with the camera. And the last step is multi-resolution TIN data whose resolution is dynamically decided by considering which direction user take notice currently. Specialty, the TIN of the last step is designed for realtime camera navigation. By using the structure we implemented realtime surface clipping, efficient approximation of height field and the locally detailed surface LOD(Level of Detail). We used the initial 10-meter sampling DEM data of Seoul, KOREA and implement the structure to the 3D Virtual GIS based on the Internet.

  • PDF

A Fast Processing Algorithm for Lidar Data Compression Using Second Generation Wavelets

  • Pradhan B.;Sandeep K.;Mansor Shattri;Ramli Abdul Rahman;Mohamed Sharif Abdul Rashid B.
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.1
    • /
    • pp.49-61
    • /
    • 2006
  • The lifting scheme has been found to be a flexible method for constructing scalar wavelets with desirable properties. In this paper, it is extended to the UDAR data compression. A newly developed data compression approach to approximate the UDAR surface with a series of non-overlapping triangles has been presented. Generally a Triangulated Irregular Networks (TIN) are the most common form of digital surface model that consists of elevation values with x, y coordinates that make up triangles. But over the years the TIN data representation has become an important research topic for many researchers due its large data size. Compression of TIN is needed for efficient management of large data and good surface visualization. This approach covers following steps: First, by using a Delaunay triangulation, an efficient algorithm is developed to generate TIN, which forms the terrain from an arbitrary set of data. A new interpolation wavelet filter for TIN has been applied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to 'modify' the point values (point coordinates for geometry) after the splitting. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the original UDAR data. The results show that this method can be used for significant reduction of data set.

Generating Cartesian Tool Paths for Machining Sculptured Surfaces from 3D Measurement Data (3차원 측정자료부터 자유곡면의 가공을 위한 공구경로생성)

  • Ko, Byung-Chul;Kim, Kwang-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.3
    • /
    • pp.123-137
    • /
    • 1993
  • In this paper, an integrated approach is proposed to generate gouging-free Cartesian tool paths for machining sculptured surfaces from 3D measurement data. The integrated CAD/CAM system consists of two modules : offset surface module an Carteian tool path module. The offset surface module generates an offset surface of an object from its 3D measurement data, using an offsetting method and a surface fitting method. The offsetting is based on the idea that the envelope of an inversed tool generates an offset surface without self-intersection as the center of the inversed tool moves along on the surface of an object. The surface-fitting is the process of constructing a compact representation to model the surface of an object based on a fairly large number of data points. The resulting offset surtace is a composite Bezier surface without self-intersection. When an appropriate tool-approach direction is selected, the tool path module generates the Cartesian tool paths while the deviation of the tool paths from the surface stays within the user-specified tolerance. The tool path module is a two-step process. The first step adaptively subdivides the offset surface into subpatches until the thickness of each subpatch is small enough to satisfy the user-defined tolerance. The second step generates the Cartesian tool paths by calculating the intersection of the slicing planes and the adaptively subdivided subpatches. This tool path generation approach generates the gouging-free Cartesian CL tool paths, and optimizes the cutter movements by minimizing the number of interpolated points.

  • PDF

Surface Extraction from Point-Sampled Data through Region Growing

  • Vieira, Miguel;Shimada, Kenji
    • International Journal of CAD/CAM
    • /
    • v.5 no.1
    • /
    • pp.19-27
    • /
    • 2005
  • As three-dimensional range scanners make large point clouds a more common initial representation of real world objects, a need arises for algorithms that can efficiently process point sets. In this paper, we present a method for extracting smooth surfaces from dense point clouds. Given an unorganized set of points in space as input, our algorithm first uses principal component analysis to estimate the surface variation at each point. After defining conditions for determining the geometric compatibility of a point and a surface, we examine the points in order of increasing surface variation to find points whose neighborhoods can be closely approximated by a single surface. These neighborhoods become seed regions for region growing. The region growing step clusters points that are geometrically compatible with the approximating surface and refines the surface as the region grows to obtain the best approximation of the largest number of points. When no more points can be added to a region, the algorithm stores the extracted surface. Our algorithm works quickly with little user interaction and requires a fraction of the memory needed for a standard mesh data structure. To demonstrate its usefulness, we show results on large point clouds acquired from real-world objects.

NETWORK DESIGN AND PREPROCESSING FOR MULTI-SCALE SPHERICAL BASIS FUNCTION REPRESENTATION

  • Oh, Hee-Seok;Kim, Dong-Hoh
    • Journal of the Korean Statistical Society
    • /
    • v.36 no.2
    • /
    • pp.209-228
    • /
    • 2007
  • Given scattered surface air temperatures observed by a network of weather stations, it is an important problem to estimate the entire temperature field for every location on the globe. Recently, a multi-scale spherical basis function (SBF) representation was proposed by Li (1999) for representing scattered data on the sphere. However, for a successful application of Li (1999)'s method, some practical issues such as network design, bandwidth selection of SBFs and initial coefficients are to be resolved. This paper proposes automatic procedures to design network and to select bandwidths. This paper also considers a preprocessing problem to obtain a stable initial coefficients from scattered data. Experiments with real temperature data demonstrate the promising empirical properties of the proposed approaches.

Cutting Simulation of Mold & Die via Hybrid Model of DVM and Z-Map (DVM 및 Z-Map 복합모델을 이용한 금형의 모의가공)

  • 신양호;박정환;정연찬
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.5
    • /
    • pp.47-56
    • /
    • 2003
  • Geometric cutting-simulation and verification play an important role in detecting NC machining errors in mold & die manufacturing and thereby reducing correcting time & cost on the shop floor. Current researches in the area may be categorized into view-based, solid-based, and discrete vector-based methods mainly depending on workpiece models. Each methodology has its own strengths and weaknesses in terms of computing speed, representation accuracy, and its ability of numerical inspection. The paper proposes a hybrid modeling scheme for workpiece representation with z-map model and discrete vector model, which performs 3-axis and 5-axis cutting-simulation via tool swept surface construction by connecting a sequence of silhouette curves.

Adaptive B-spline volume representation of measured BRDF data for photorealistic rendering

  • Park, Hyungjun;Lee, Joo-Haeng
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.1
    • /
    • pp.1-15
    • /
    • 2015
  • Measured bidirectional reflectance distribution function (BRDF) data have been used to represent complex interaction between lights and surface materials for photorealistic rendering. However, their massive size makes it hard to adopt them in practical rendering applications. In this paper, we propose an adaptive method for B-spline volume representation of measured BRDF data. It basically performs approximate B-spline volume lofting, which decomposes the problem into three sub-problems of multiple B-spline curve fitting along u-, v-, and w-parametric directions. Especially, it makes the efficient use of knots in the multiple B-spline curve fitting and thereby accomplishes adaptive knot placement along each parametric direction of a resulting B-spline volume. The proposed method is quite useful to realize efficient data reduction while smoothing out the noises and keeping the overall features of BRDF data well. By applying the B-spline volume models of real materials for rendering, we show that the B-spline volume models are effective in preserving the features of material appearance and are suitable for representing BRDF data.

Boolean Operation of Non-manifold Model with the Data Structure of Selective Storage (선택저장 자료구조를 이용한 복합다양체 모델의 불리언 작업)

  • 유병현;한순흥
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.4
    • /
    • pp.293-300
    • /
    • 2000
  • The non-manifold geometric modeling technique is to improve design process and to Integrate design, analysis, and manufacturing by handling mixture of wireframe model, surface model, and solid model in a single data structure. For the non-manifold geometric modeling, Euler operators and other high level modeling methods are necessary. Boolean operation is one of the representative modeling method for the non-manifold geometric modeling. This thesis studies Boolean operations of non-manifold model with the data structure of selective storage. The data structure of selective storage is improved non-manifold data structure in that existing non-manifold data structures using ordered topological representation method always store non-manifold information even if edges and vortices are in the manifold situation. To implement Boolean operations for non-manifold model, intersection algorithm for topological cells of three different dimensions, merging and selection algorithm for three dimensional model, and Open Inventor(tm), a 3D toolkit from SGI, are used.

  • PDF

Volumetric NURBS Representation of Multidimensional and Heterogeneous Objects: Modeling and Applications (VNURBS기반의 다차원 불균질 볼륨 객체의 표현: 모델링 및 응용)

  • Park S. K.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.10 no.5
    • /
    • pp.314-327
    • /
    • 2005
  • This paper describes the volumetric data modeling and analysis methods that employ volumetric NURBS or VNURBS that represents heterogeneous objects or fields in multidimensional space. For volumetric data modeling, we formulate the construction algorithms involving the scattered data approximation and the curvilinear grid data interpolation. And then the computational algorithms are presented for the geometric and mathematical analysis of the volume data set with the VNURBS model. Finally, we apply the modeling and analysis methods to various field applications including grid generation, flow visualization, implicit surface modeling, and image morphing. Those application examples verify the usefulness and extensibility of our VNUBRS representation in the context of volume modeling and analysis.

Esthetics of Dental Materials (임상가를 위한 특집 3 - 치과용 심미수복재의 심미적 특성)

  • Ahn, Jin-Soo
    • The Journal of the Korean dental association
    • /
    • v.51 no.1
    • /
    • pp.18-24
    • /
    • 2013
  • Esthetic aspect is one of the most important factors in clinical dentistry. Esthetics of dental restorative materials consist of translucency, surface texture, and most importantly 'colour'. Main characteristics of optical properties and its clinical representation and general outlook as to the current information on colour and its representation has been considered in this study. Characteristics of esthetic materials are concerned with the field of science and dental professionals should take into consideration the importance, characteristics, and applications to actual clinical settings of esthetic restorative materials. Relevant information regarding natural teeth and esthetic restorative materials and training will lead to the heightened ability of dental professionals.