Results 261 to 270 of about 5,773 (293)
Some of the next articles are maybe not open access.

Coding polygon meshes as compressable ASCII

Proceedings of the seventh international conference on 3D Web technology, 2002
Because of the convenience of a text-based format 3D content is often published in form of a gzipped file that contains an ASCII description of the scene graph. While compressed image, audio, and video data is kept in seperate binary files, polygonal data is usually included uncompressed into the ASCII description, as there is no widely-accepted ...
Martin Isenburg, Jack Snoeyink
openaire   +1 more source

Robust watermarking of polygonal meshes

Proceedings Geometric Modeling and Processing 2000. Theory and Applications, 2000
This paper presents two variations of a robust watermarking method for general polygonal meshes of arbitrary topology which can be used for copyright protection, tamper proofing or content annotation purposes. The proposed watermark is immune to translation, rotation, scaling or affine transformation of the mesh and is hard to detect unless the exact ...
openaire   +1 more source

Smooth Polylines on Polygon Meshes

2004
Curves on surfaces can be very useful to visualize surface features at low graphical and memory cost. Curves on surfaces are also used for surface segmentation with possible applications to visualization, reconstruction and parameterization of complex surfaces. In this paper a simple and efficient algorithm for building smooth polylines on triangulated
Georges-Pierre Bonneau, Stefanie Hahmann
openaire   +1 more source

Line Detection from 3D Polygonal Meshes

2010 Proceedings of the 5th International Conference on Ubiquitous Information Technologies and Applications, 2010
There are a number of techniques for line detection from 3D models, but not many of them exploit full power of modern graphical processor units. In this paper, we present high performance algorithm for line drawing based on idea of geometric buffers. Our processing is divided into two parts: first, geometric information required for further processing ...
Soo-Kyun Kim, Seok-Hun Kim, Jin-Sul Kim
openaire   +1 more source

Fast polygon mesh querying by example

ACM SIGGRAPH 99 Conference abstracts and applications, 1999
The reusability of three-dimensional models has lead to a proliferation in the number and size of 3D object repositories. These typically store objects in the some polygon mesh file format and allow selection by means of categories and keywords. While keyword searches are useful in many circumstances, they suffer from the subjectivity, ambiguity and ...
James Gain, James Scott
openaire   +1 more source

Topological analysis of polygon meshes

Computer-Aided Design, 1983
Abstract A mesh of quasidisjoint polygons is a useful representation of a surface for many applications of computer graphics and CAD. We present an algorithm that calculates the following information for an arbitrary orientable mesh: • • the number of connected components of the mesh • • for each component whether it is closed or not ...
openaire   +1 more source

Accurate collision response on polygonal meshes

Proceedings Computer Animation 2000, 2002
We present a very general geometrical correction method for enforcing collisions and other geometrical constraints between polygonal mesh surfaces. It is based on a global resolution scheme that takes advantage of an efficient use of the conjugate gradient algorithm to find the appropriate displacement of the mesh vertices that would satisfy all the ...
P. Volino, N.M. Thalmann
openaire   +1 more source

Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain

2001
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright and to detect tampering. This paper presents a new robust watermarking method that adds watermark into a 3D polygonal mesh in the mesh's spectral domain.
Ohbuchi, Ryutarou   +3 more
openaire   +1 more source

Polygonal mesh watermarking using Laplacian coordinates

Computer Graphics Forum, 2010
AbstractWe propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y,z) of the mesh vertices, then construct the histogram of the lengths of the (x,y,z) vectors, and finally, insert the watermark by altering the shape of that histogram.
Yang, Ying, Ivrissimtzis, Ioannis
openaire   +2 more sources

Making sky lanterns from polygonal meshes

Computers & Electrical Engineering, 2014
Releasing sky lanterns is a popular way of celebrating festivals and ceremonies in the Asian countries. This paper presents a computer-aided approach to help novice users to design flyable sky lantern with desired shape. Given a closed up-right 3D model with a user-specified cutting on the bottom, our system optimizes the shape by regularizing the ...
Lin, Juncong   +5 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy