Now showing items 33-43 of 43

    • Reconstruction with 3D Geometric Bilateral Filter 

      Miropolsky, A.; Fischer, A. (The Eurographics Association, 2004)
      In recent years, reverse engineering (RE) techniques have been developed for surface reconstruction from 3D scanned data. Typical sampling data, however, usually is large scale and contains unorganized points, thus leading ...
    • Residual Iteration and Accurate Polynomial Evaluation for Shape-interrogation Applications 

      Hoffmann, C.; Park, with G.; Simard, J-R.; Stewart, N. F. (The Eurographics Association, 2004)
      Surface interrogation and intersection depend crucially on good root-finding algorithms, which in turn depend on accurate polynomial evaluation. Conventional algorithms for evaluation typically encounter difficulties near ...
    • Shape Similarity Measurement Using Ray Distances for Mass Customization 

      Hwang, T. J.; Lee, K.; Jeong, J. H.; Oh, H. Y. (The Eurographics Association, 2004)
      Custom-tailored products are defined as products having various sizes and shapes tailored to meet the customer's different tastes or needs. Thus fabrication of custom-tailored products inherently involves inefficiency. To ...
    • Shortest Circuits with Given Homotopy in a Constellation 

      Michelucci, D.; Neveu, M. (The Eurographics Association, 2004)
      Abstract A polynomial method is described for computing the shortest circuit with a prescribed homotopy on a surface. The surface is not described by a mesh but by a constellation: a set of sampling points. Points close ...
    • Spline Approximation of General Volumetric Data 

      Roessl, C.; Zeilfelder, F.; Nuernberger, G.; Seidel, Hans-Peter (The Eurographics Association, 2004)
      We present an efficient algorithm for approximating huge general volumetric data sets, i.e. the data is given over arbitrarily shaped volumes and consists of up to millions of samples. The method is based on cubic trivariate ...
    • Stability and Homotopy of a Subset of the Medial Axis 

      Chazal, F.; Lieutier, A. (The Eurographics Association, 2004)
      Medial Axis is known to be unstable for non smooth objects. The Medial Axis has applications in image analysis and mathematical morphology, Solid Modeling, or domain decomposition for CAD to CAE (i.e. Finite Elements) ...
    • Tolerance Envelopes of Planar Parametric Part Models 

      Ostrovsky-Berman, Y.; Joskowicz, L. (The Eurographics Association, 2004)
      We present a framework for the systematic study of parametric variation in planar mechanical parts and for ef ciently computing approximations of their tolerance envelopes. Part features are speci ed by explicit functions ...
    • Topological and Geometric Beautification of Reverse Engineered Geometric Models 

      Langbein, F. C.; Marshall, A. D.; Martin, R. R.; Mills, B. I.; Gao, C. H. (The Eurographics Association, 2004)
      Boundary representation models reverse engineered from 3D range data suffer from various inaccuracies caused by noise in the measured data and the model building software. Beauti cation aims to improve such models in a ...
    • Tracing Surface Intersection with a Validated ODE System Solver 

      Mukundan, H.; Ko, K. H.; Maekawa, T.; Sakkalis, T.; Patrikalakis, N. M. (The Eurographics Association, 2004)
      This paper presents a robust method for tracing intersection curve segments between continuous rational parametric surfaces, typically rational polynomial parametric surface patches. The tracing procedure is based on a ...
    • Update Operations on 3D Simplicial Decompositions of Non-manifold Objects 

      Floriani, L. De; Hui, A. (The Eurographics Association, 2004)
      We address the problem of updating non-manifold mixed-dimensional objects, described by three-dimensional simplicial complexes embedded in 3D Euclidean space. We consider two local update operations, edge collapse and ...
    • Using Cayley Menger Determinants 

      Michelucci, D.; Foufou, S. (The Eurographics Association, 2004)
      We use Cayley-Menger Determinants (CMDs) to obtain an intrinsic formulation of geometric constraints. First, we show that classical CMDs are very convenient to solve the Stewart platform problem. Second, issues like distances ...