ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C.: Point set surfaces. In Proc. IEEE Visualization (2001), pp. 21--28. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Direct Reconstruction of a Displaced Subdivision - Surface From Unorganized (Correct)
....force f of a vertex is a vector between the subdivided bounding box b and the given points . For each vertex v i of the bounding box, we simply find the nearest point x j , calculate an attracting force vector f v i , and apply it back to the vertex v i with a projection speed parameter [0, 1]. Finding a nearest point is a well known problem, and we used the kd tree searching algorithm in our implementation [3, 6] f v i = x j b = v i f v i ) For a subdivided bounding box, it is possible that two or more vertices of the box are attracted by the same input point. In such a ....
....the Igea model (see Sec. 4) It has to be considered, though, that even the fitting of smooth surfaces may result in discontinuous sampling since the fitted surfaces might not be connected smoothly. We expect that this can be overcome by employing a method that guarantees global continuity as in [1]. In practice, the finding ray triangle intersections usually results in good visual appearance and fast sampling. Flipping or self intersection after displacement sampling might be found on the region where the domain surface and the points are too far from each other, and this happens when the ....
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T.Silva. Point set surfaces. In IEEE Visualization 2001.
Moving Least Squares Multiresolution Surface Approximation - Mederos, Velho, de.. (2003) (1 citation) (Correct)
....based on k nearest neighbors. This is somewhat similar to what is done in [8, 9, 13] For each border edge, the algorithm uses an angle criteria to select a point to make a triangle with the edge. The initial triangulation is refined using a new method based on moving least square operators [1 3]. Our algorithm does not need Delaunay triangulations and it can handle surfaces with borders. Section 2 describes in detail the four steps of our method: clustering, reduction, triangulation, and refinement. These steps are illustrated above. Section 4 discusses several examples of the method in ....
....of points into a finite set of clusters, such that the curvature of the original surface varies Figure 1: Point clouds a little within each cluster. Since is not known, its curvature must be estimated from the sample points Q. We use a hierarchical clustering method based on a BSP tree [1]. Each node in this tree contains a subset p 1 , p n of the original point Q. We use the covariance matrix C of to decide whether or not to subdivide the node: C = # # # # . # # # T # # # . # # # , p = i=1 p i . Note that ....
[Article contains additional citation context not shown here]
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, C. Silva. Point set surfaces. IEEE Visualization 2001, pp. 21--28.
PMR: Point to Mesh Rendering, A Feature-Based Approach - Dey, Hudson (Correct)
....Most of the computation during rendering a mesh is devoted to rasterizing polygons. Consequently, efforts have focused on replacing them with easier primitives such as points that can be rendered as pixels. This has led to intense research on point cloud representation of models in recent years [1, 23, 25, 24, 30]. The notion of points as rendering primitive dates back as early as 1974 This research is partially supported by NSF under grants CCR 9988216 and DMS 0138456 (subcontract: Stanford University) with the work of Catmull [3] In 1985 Levoy and Whitted proposed points exclusively as the primitive ....
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin and C. T. Silva. Point set surfaces. Proc. Visualization
Hardware Accelerated Point Rendering of Isosurfaces - Brentzen, Christensen (2003) (1 citation) (Correct)
.... a set of points that can be rendered multiple times and then solve the visibility problem either by rendering the points using scaled discs or ellipsoids [Rusin00, Zwick01b] by employing a screen space method to fill holes [Gross98] or by resampling the point set to match output resolution [Alexa01]. Our approach is to scale the points, and we use the OpenGL point primitive for rendering. The first contribution of this work is that we propose a technique for scaling points according to the distance between the point and the image plane. Doing this manually by calling the glPointSize ....
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C.T. Silva. Point set surfaces. Proceedings of the IEEE Visualization Conference, pages 21--28, 2001.
Surface Splatting: Theory, Extensions and Implementation - Räsänen (2002) (Correct)
....The splats are oriented along the view plane and rendered in a back to front order as textured quads. This is a rather ad hoc solution to reconstruction, but it allows the use of polygon rendering hardware, and thus it is very fast. Transparency and antialiasing are not considered. Alexa et al. [3] construct a polynomial approximation to the surface given a possibly noisy point set. They also provide methods for adding and removing points on the surface. Rendering is done with a hierarchy of spheres as in QSplat. Instead of splatting each point, they generate as many points on the surface ....
....One of the reasons why point representations are attractive is the easy acquisition of real life models. 3D scanners readily output point samples, possibly with surface color [37] The surface should then be denoised, and the surface normal and the local variance matrix estimated from the samples [3]. As 3D scanners become more commonplace and point rendering methods become more advanced, a need arises to use points in modeling as well. This requires methods for upsampling and downsampling, bandlimiting, deforming and otherwise manipulating point based objects. With proper signal processing ....
[Article contains additional citation context not shown here]
Marc Alexa, Johannes Behr, Daniel Cohen-Or, Shachar Fleishman, David Levin, and Claudio T. Silva. Point set surfaces. In IEEE Visualization 2001.
Multi-scale Feature Extraction on Point-sampled Surfaces - Pauly, Keiser, Gross (2003) (Correct)
.... Reducing the representation to the essentials, i.e. the geometric position of the sample points, is particularly useful when dealing with large data sets generated by modem acquisition devices [15] To display such models, numerous pointbased rendering systems have been developed, e.g. [20, 21, 25, 1]. Apart from acquisition and rendering, a variety of geometry processing applications have been introduced recently [18, 19, 26] that demonstrate the versatility of points as a geometric modeling primitive. In this paper, we present a new method for detecting and extracting line type features on ....
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., Silva, T. Point Set Surfaces, IEEE Visualization 01, 2001
Representing and Rendering Surfaces with Points - Krivanek (2003) (Correct)
.... 2001 brought the EWA surface splatting [67] dynamic (on the fly) object sampling during rendering [58, 55] hybrid polygon point rendering systems [12, 15] differential points [29] spectral processing of point sampled surfaces [40] multiresolution point based modeling [33] and the MLSsurfaces [2]. EWA surface splatting of Zwicker et al. 67] combines the ideas of Levoy and Whitted [32] with Heckbert s resampling framework [27] to produce a high quality splatting technique that features anisotropic texture filtering, edge antialiasing and order independent transparency. Zwicker et al. ....
....the result of the filtering operation. Linsen [33] proposed a multiresolution modeling framework for point sampled surfaces. He developed up and down sampling operators, surface smoothing and multiresolution decomposition. He also applied CSG operations to point sampled surfaces. Alexa et al. [2] proposed a point based surface definition that builds on fitting a local polynomial approximation to the point set using moving least squares (MLS) The result of the MLS fitting is a smooth, 2 manifold surface for any point set. They used the MLS surfaces to up and down sample the point set and ....
[Article contains additional citation context not shown here]
Marc Alexa, Johannes Behr, Daniel Cohen-Or, Shachar Fleishman, David Levin, and Claudio T. Silva. Point set surfaces. In Proceedings of IEEE Visualization, pages 21--28, 2001. 3, 4, 5, 8, 18, 19, 22, 23, 25
The Randomized Sample Tree: A Data Structure for Interactive - Walkthroughs In Externally (2002) (Correct)
....objects are viewed very closely and if points are projected to more than one pixel, it results in blocky images. A solution to overcome this problem is the interpolation between adjacent points which sometimes results in artifacts [21] A further solution for the problem of close views is given by [1, 27, 31], who use locally adapted sample densities for the rendering of complex geometry. Chen and Nguyen [3] use triangles and points for the rendering of large mesh models with the ability of close views. In contrast, our approach generally uses polygons for rendering. Points or splats can additionally ....
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. In Proc. IEEE Visualization 2001.
Eurographics Symposium on Point-Based Graphics (2004) - Alexa Rusinkiewicz Editors Self-citation (Alexa) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C.: Point set surfaces. In Proc. IEEE Visualization (2001), pp. 21--28.
Multi-level Partition of Unity Implicits - Yutaka Ohtake Mpi (2003) (11 citations) Self-citation (Alexa) (Correct)
No context found.
ALEXA, M., BEHR, J., COHEN-OR, D., FLEISHMAN, S., LEVIN, D., AND SILVA, C. T. 2001. Point set surfaces. In IEEE Visualization 2001, 21--28.
Sparse Low-degree Implicit Surfaces with Applications to.. - Ohtake, Belyaev, Alexa (2005) Self-citation (Alexa) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. In IEEE Visualization 2001 (2001), pp. 21--28. 1, 9
Layered Point Clouds - Gobbetti, Marton (2004) Self-citation (Alexa) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. In Proceedings of the conference on Visualization '01 (2001), IEEE Computer Society, pp. 21--28. 2
Uncertainty and Variability in Point Cloud Surface Data - Pauly, Mitra, Guibas (2004) Self-citation (Alexa) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. In Proceedings of the conference on Visualization '01 (2001), pp. 21--28. 2, 6
A Barcode Shape Descriptor for Curve Point Cloud Data - Collins, Zomorodian.. (2004) Self-citation (Alexa) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. In Proc. Vis. (2001).
Eurographics Symposium on Point-Based Graphics (2004) - Alexa Rusinkiewicz Editors Self-citation (Alexa) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. Silva. Point set surfaces. In Proceedings of IEEE Visualization, pages 21--28, San Diego, CA, October 2001.
Modeling and Rendering of Real Environments - Correa, Oliveira, Silva, Wang Self-citation (Silva) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. IEEE Visualization 2001.
Approximating and Intersecting Surfaces from Points - Adamson, Alexa (2003) (3 citations) Self-citation (Alexa) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. In IEEE Visualization 2001, pages 21--28, October 2001. ISBN 0-7803-7200-x.
Direction Fields over Point-Sampled Geometry - Alexa, Klug, Stoll (2003) (2 citations) Self-citation (Alexa) (Correct)
No context found.
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., Silva, T. Point Set Surfaces, 1EEE Visualization 01, pp. 21-28, 2001
Towards Point-Based Acquisition and Rendering of Large.. - Corrêa, Fleishman, Silva Self-citation (Fleishman Silva) (Correct)
....To verify that the process works, we scanned the calibration image several times from different angles and distances, and applied the tool to these new scans. We obtained very similar correction tables for all cases. To remove noise, we apply the moving least squares (MLS) projection of Levin [2, 18], with a weight function q (d) e d 2 h 2 . We set h = 4a, where a is the scanner s accuracy (0.5 in. Figure 4f shows a smoothed version of the bias calibration image, and Figure 5 shows the application of the noise removal procedure to a scanned desktop. Figure 5: Removing noise. a) ....
....and so on. We adjust the splat size according to the level of detail using glPointSize( The system can also automatically pick the level of detail based on the user s speed. For high quality rendering, which requires shading, we find the normal vectors at each point p using MLS projection [2], and choose the normal n that satisfies p n 0. Because the origin of a scan is at the position 0 of the scanner, and since every scanned point faces the scanner, p 0 is an estimate of the normal at p. The MLS projection operator is local, i.e. to project a point, we only need to apply the ....
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. IEEE Visualization 2001.
Ray Tracing Point Set Surfaces - Adamson, Alexa (2003) (2 citations) Self-citation (Alexa) (Correct)
..... Primary and secondary rays intersect the same surface. The resulting image of the shape is view independent, which is a prerequisite for the generation of animated sequences. Renderings of CSG defined shapes are possible. As a surface definition based on points we use point set surfaces [1, 2], which are an implementation on Levin s MLS based approximation procedure [17] This surface definition has several advantages in the context of ray tracing: The computation is local, which allows to evaluate the surface only in the vicinity of the ray surface intersection. It is ....
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. In IEEE Visualization
Point Set Surfaces with Sharp Features - Reuter, Joyot, Trunzler.. (2005) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., LEVIN D., FLEISHMAN S., SILVA C. T.: Point set surfaces. In Proceedings of IEEE Visualization (2001).
Reconstructing Implicit Surfaces with Sharp Edges via Enriched . .. - Reuter, al. (2004) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, D. Levin, S. Fleishman, and C. T. Silva. Point set surfaces. In IEEE Visualization 2001.
Efficient Reconstruction of Large Scattered Geometric.. - Tobor, Reuter, al. (2004) (Correct)
No context found.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, David Levin, Shachar Fleishman, and Claudio T. Silva. Point set surfaces. In IEEE Visualization 2001, pages 21--28. IEEE, October 2001.
Intrinsic Point Cloud Simplification - Carsten Moenning And (Correct)
No context found.
ALEXA, M., BEHR, J., COHEN-OR, D., FLEISHMAN, S., LEVIN, D., AND SILVA, T. 2001. Point set surfaces. In Proc. 12th IEEE Visual., 21--28.
Multi-Scale Reconstruction of Implicit Surfaces with.. - Tobor, Reuter, Schlick (2004) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, D. Levin, S. Fleishman, and C. T. Silva. Point set surfaces. In IEEE Visualization 2001.
Surface Reconstruction with Enriched Reproducing.. - Reuter, Joyot.. (2005) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., LEVIN D., FLEISHMAN S., SILVA C. T.: Point set surfaces. In Proceedings of IEEE Visualization (2001).
Interactive Solid Texturing using Point-based.. - Representations Patrick.. (2004) (Correct)
No context found.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, David Levin, Shachar Fleishman, and Claudio T. Silva. Point set surfaces. In IEEE Visualization 2001, pages 21--28, October 2001.
Volume xx (200y), Number z, pp. 1--11 - Fast Hybrid Approach (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. IEEE Visualization (October 2001), 21--28.
Reconstructing Manifold and Non-Manifold Surfaces from Point .. - Jianning Wang Manuel (2005) (Correct)
No context found.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, Shachar Fleishman, David Levin, and Claudio T. Silva. Point set surfaces. IEEE Visualization, pages 21--28, 2001.
A Multi-scale Approach to 3D Scattered Data Interpolation .. - Ohtake, Belyaev, Seidel (2003) (3 citations) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. In IEEE Visualization 2001.
EUROGRAPHICS 2002 / G. Drettakis and H.-P. Seidel - Guest Editors Vo (2002) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. Silva. Point Set Surfaces. In Proceedings of IEEE Visualization, pages 21--28. San Diego, CA, October 2001. 2
Interactive Boolean Operations on Surfel-Bounded Solids - Bart Adams Philip (2003) (10 citations) (Correct)
No context found.
ALEXA, M., BEHR, J., COHEN-OR, D., FLEISHMAN, S., LEVIN, D., AND SILVA, C. T. 2001. Point set surfaces. IEEE Visualization 2001 (October), 21--28.
A Coordinate System Associated With Points Scattered on a.. - Boissonnat, Flötotto (2000) (Correct)
No context found.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, David Levin, Shachar Fleishman, and Claudio T. Silva. Point set surfaces. In Proceedings of Visualization 2001.
Normal Improvement for Point Rendering - Jones, Durand, Zwicker (2004) (Correct)
No context found.
M. Alexa et al., "Point Set Surfaces," Proc. IEEE Visualization, IEEE CS Press, 2001, pp. 21-28.
CSG Tree Rendering for Point-Sampled Objects - Martin Wicke Matthias (2004) (1 citation) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point Set Surfaces. In Proceedings of Visualization 2002.
Layered Point Clouds: a Simple and Efficient Multiresolution .. - Gobbetti, Marton (2004) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, C. T. Silva, Point set surfaces, in: Proceedings of the conference on Visualization '01, IEEE Computer Society, 2001, pp. 21--28.
CSG Tree Rendering for Point-Sampled Objects - Martin Wicke Matthias (2004) (1 citation) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point Set Surfaces. In Proceedings of Visualization 2002.
A Barcode Shape Descriptor for Curve Point - Cloud Data Anne (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, C. T. Silva, Point set surfaces, in: Proc. Vis., 2001.
Quasi-Rigid Objects in Contact - Pauly, Pai, Guibas (2004) (Correct)
No context found.
ALEXA M., BEHR J., COHEN-OR D., FLEISHMAN S., LEVIN D., SILVA C. T.: Point set surfaces. In Proceedings of Visualization '01 (2001). 3
Statistical Point Geometry - Kalaiah, Varshney (2003) (5 citations) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, C. Silva, and D. Levin. Point set surfaces. In IEEE Visualization 2001, pages 21--28, October 2001.
Modeling and Rendering of Points with Local Geometry - Kalaiah, Varshney (2002) (4 citations) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, C. Silva, and D. Levin, "Point set surfaces," in IEEE Visualization
Mitsubishi Electric Research Laboratories - Http Www Merl (2002) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. Silva. Point Set Surfaces. In Proceedings of IEEE Visualization, pages 21--28. San Diego, CA, October 2001. 2
Robust Watermarking of Point-Sampled Geometry - Daniel Cotting Tim (2004) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. "Point set surfaces." In IEEE Visualization 2001.
Robust Watermarking of Point-Sampled Geometry - Daniel Cotting Tim (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. "Point set surfaces." In IEEE Visualization 2001.
Alcom-FT Technical Report Series - Alcomft-Tr- The Randomized (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. In Proc. IEEE Visualization 2001.
Interactive Solid Texturing Using Point-based.. - Reuter, Schmitt.. (2004) (Correct)
No context found.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, David Levin, Shachar Fleishman, and Claudio T. Silva. Point set surfaces. In IEEE Visualization 2001, pages 21--28, October 2001.
View Dependent Stochastic Sampling for Efficient Rendering.. - Bhakar, Luo, Mudur (2004) (Correct)
No context found.
Alexa,M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., Silva, T., " Point Set Surfaces", Proc. IEEE Visualization 01.
Efficient Reconstruction of Large Scattered Geometric.. - Tobor, Reuter, al. (2004) (Correct)
No context found.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, David Levin, Shachar Fleishman, and Claudio T. Silva. Point set surfaces. In IEEE Visualization 2001, pages 21--28. IEEE, October 2001.
High-Quality Point-Based Rendering on Modern GPUs - Botsch, Kobbelt (2003) (5 citations) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, and C. Silva. Point set surfaces. In Proc. IEEE Visualization 2001.
Frame-Coherent Stippling - Pastor, Strothotte (2002) (1 citation) (Correct)
No context found.
M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C. T. Silva. Point set surfaces. In Proceedings of the IEEE Visualization Conference, pages 21 28, 2001. http://www. igd.fhg.de/alexaJ paper/index.html. 3, 7
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC