Results 21 to 30 of about 30,819 (118)
Gap Processing for Adaptive Maximal Poisson-Disk Sampling [PDF]
, 2013 In this paper, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets.
Wonka, Peter, Yan, Dong-Ming
core
Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation
, 2014 We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation ...
Bandyapadhyay, Sayan +2 more
core +1 more source
Single-Strip Triangulation of Manifolds with Arbitrary Topology
, 2004 Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many heuristics have been proposed to partition models into few long strips.
Eppstein, David, Gopi, M.
core +2 more sources
An Overview of Rendering from Volume Data --- including Surface and Volume Rendering [PDF]
, 1993 Volume rendering is a title often ambiguously used in science. One meaning often quoted is: `to render any three volume dimensional data set'; however, within this categorisation `surface rendering'' is contained.
Roberts, Jonathan C.
core +2 more sources
A programme to determine the exact interior of any connected digital picture [PDF]
, 2014 Region filling is one of the most important and fundamental operations in computer graphics and image processing. Many filling algorithms and their implementations are based on the Euclidean geometry, which are then translated into computational models ...
Batista, Valério Ramos +1 more
core
KURVA BEZIER DAN BRESENHAM UNTUK PEMBUATAN LINGKARAN
Jurnal Informatika, 2001 One of the primitive in computer graphics is a circle. It needs a special method to draw a circle like Bezier method and Bresenham algorithm. According to Bezier method, it use polygon control points to draw circle but it use coordinate points of ...
Djoni Haryadi Setiabudi
doaj
QuickCSG: Fast Arbitrary Boolean Combinations of N Solids [PDF]
, 2017 QuickCSG computes the result for general N-polyhedron boolean expressions without an intermediate tree of solids. We propose a vertex-centric view of the problem, which simplifies the identification of final geometric contributions, and facilitates its ...
Douze, Matthijs +2 more
core +2 more sources
Isotopic Equivalence from Bezier Curve Subdivision [PDF]
, 2013 We prove that the control polygon of a Bezier curve B becomes homeomorphic and ambient isotopic to B via subdivision, and we provide closed-form formulas to compute the number of iterations to ensure these topological characteristics.
Li, J., Peters, T. J ., Roulier, J. A.
core
Connectivity Compression for Irregular Quadrilateral Meshes [PDF]
, 1999 Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes.
King, Davis +2 more
core +6 more sources
Areas of lattice polygons, applied to computer graphics [PDF]
, 1987 Рен Динг, John R. Reay
openalex +1 more source