Search Results - I.3.3 [Computer Graphics]: Computational Geometry AND Object Modeling-[Geometric algorithms~

Pattern-Based Quadrangulation for N-Sided Patches by Takayama, Kenshi, Panozzo, Daniele, Sorkine-Hornung, Olga

“…We propose an algorithm to quadrangulate an N‐sided patch (2 ≤ N ≤ 6) with prescribed numbers of edge subdivisions at its boundary…”
Get full text

Interactive Modeling of Mechanical Objects by Ureta, Francisca Gil, Tymms, Chelsea, Zorin, Denis

“… Direct design of joint geometry often requires more effort than the design of the rest of the object geometry, as it requires design of components that stay in precise contact, are aligned…”
Get full text

Autocorrelation Descriptor for Efficient Co-Alignment of 3D Shape Collections by Averkiou, Melinos, Kim, Vladimir G., Mitra, Niloy J.

“…‐to‐back, while even the simplest algorithm would not erroneously pick orthogonal alignment…”
Get full text

Modeling and Exploring Co‐variations in the Geometry and Configuration of Man‐made 3D Shape Families by Laga, Hamid, Tabia, Hedi

“…‐vary across a family of man‐made 3D shapes. While man‐made 3D objects exhibit large geometric and structural variations, the geometry, structure, and configuration…”
Get full text

Non-Oriented MLS Gradient Fields by Chen, Jiazhou, Guennebaud, Gaël, Barla, Pascal, Granier, Xavier

“…We introduce a new approach for defining continuous non‐oriented gradient fields from discrete inputs, a fundamental stage for a variety of computer graphics applications such as surface or curve reconstruction, and image stylization…”
Get full text

Efficient Geometry Compression for GPU-based Decoding in Realtime Terrain Rendering by Dick, Christian, Schneider, Jens, Westermann, Rüdiger

“…We present a geometry compression scheme for restricted quadtree meshes and use this scheme for the compression of adaptively triangulated digital elevation models (DEMs…”
Get full text

A GPU-based Approach for Massive Model Rendering with Frame-to-Frame Coherence by Peng, Chao, Cao, Yong

“…Rendering massive 3D models in real‐time has long been recognized as a very challenging problem because of the limited computational power and memory space available in a workstation…”
Get full text

Thumbnail galleries for procedural models by Lienhard, S., Specht, M., Neubert, B., Pauly, M., Müller, P.

“…Procedural modeling allows for the generation of innumerable variations of models from a parameterized, conditional or stochastic rule set…”
Get full text

Efficient and Quality Contouring Algorithms on the GPU by Schmitz, L., Scheidegger, L. F., Osmari, D. K., Dietrich, C. A., Comba, J. L. D.

“…) and Marching Tetrahedra (MT) to modern Graphics Processing Unit (GPU) architectures. Other isosurfacing algorithms, however, are not so easily portable to GPUs, either…”
Get full text

Crack-free rendering of dynamically tesselated B-rep models by Claux, Frédéric, Barthe, Loïc, Vanderhaeghe, David, Jessel, Jean-Pierre, Paulin, Mathias

“… The algorithm we propose reliably detects then fills up cracks in the rendered image. Crack detection works in image space, using depth information, while crack…”
Get full text

Extracting Sharp Features from RGB‐D Images by Cao, Y‐P., Ju, T., Xu, J., Hu, S‐M.

“… We consider the problem of extracting sharp edges from a sparse set of colour‐and‐depth (RGB‐D) images. The noise‐ridden depth measurements are challenging for existing feature extraction methods that work solely in the geometric domain…”
Get full text

A Flexible Kernel for Adaptive Mesh Refinement on GPU by Boubekeur, T., Schlick, C.

“… Finally, the refined patch produced for each triangle can be displaced by the vertex shader, using any kind of geometric refinement, such as Bezier…”
Get full text

Autostereoscopic Rendering of Multiple Light Fields by Escrivá, M., Blasco, J., Abad, F., Camahort, E., Vivó, R.

“…Light fields were introduced a decade ago as a new high‐dimensional graphics rendering model…”
Get full text

SideKnot: Revealing relation patterns for graph visualization by Dichao Peng, Neng Lu, Wei Chen, Qunsheng Peng

“… In addition, many edge bundling algorithms are computationally complex to prevent them from scaling up for extremely large graphs…”
Get full text