Results 271 to 280 of about 5,652 (312)
Some of the next articles are maybe not open access.
Delaunay Triangular Meshes in Convex Polygons
SIAM Journal on Scientific and Statistical Computing, 1986Es wird ein Algorithmus vorgestellt, der eine Triangularisierung eines gegebenen konvexen Polygons P erzeugt (dies ist ein Teilschritt für die Finite-Element-Triangularisierung eines komplexen polygonalen Bereichs). Im Inneren von P entsteht ein quasi-gleichmäßiges Dreiecksgitter der Größe h, die auf dem Rand von P liegenden Dreiecksseiten haben auf ...
openaire +1 more source
A novel mesh saliency approximation for polygonal mesh segmentation
Multimedia Tools and Applications, 2017To assist a great variety of applications including object recognition or shape matching, 3D scene analysis, view point selection, mesh simplification, segmentation, and 3D printing etc., the approximation of mesh or part saliency has been intensively studied in recent years.
Hung-Kuang Chen, Mu-Wei Li
openaire +1 more source
Fracture generation on polygonal meshes using Voronoi polygons
ACM SIGGRAPH 2002 conference abstracts and applications, 2002This sketch describes a way of generating realistic cracks and fragments to visually simulate brittle fracture on polygonal surfaces.
openaire +1 more source
Decomposing polygon meshes for interactive applications
Proceedings of the 2001 symposium on Interactive 3D graphics, 2001This paper discusses an efficient and effective framework to decompose polygon meshes into components. This is useful in various interactive graphics applications, such as, mesh editing, establishing correspondence between objects for morphing, computation of bounding volume hierarchy for collision detection and ray tracing. In this paper, we formalize
Xuetao Li +3 more
openaire +1 more source
Coding polygon meshes as compressable ASCII
Proceedings of the seventh international conference on 3D Web technology, 2002Because 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, 2000This 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
2004Curves 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, 2010There 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, 1999The 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, 1983Abstract 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

