In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum alternative approaches to generation, as well post-processing algorithms connectivity editing and optimization. For each technique, highlight capabilities limitations, also pointing out associated unsolved challenges. Recent relaxed approaches, aiming generate not pure-hex but hex-dominant meshes, are discussed. The required background, pertaining geometrical combinatorial...

Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one hardest problems has been to reduce number triangles (or polygons) generated. The paper presents an algorithm that considerably reduces polygons generated by a Marching Cubes-like scheme (W. Lorensen and H. Cline, 1987) without excessively increasing overall computational complexity. assumes discretization dataset space replaces cell edge interpolation midpoint selection. Under these...

PolyCubes, or orthogonal polyhedra, are useful as parameterization base-complexes for various operations in computer graphics. However, computing quality PolyCube general shapes, providing a good trade-off between mapping distortion and singularity counts, remains challenge. Our work improves on the state-of-the-art computation by adopting graph-cut inspired approach. We observe that, given an arbitrary input mesh, of suitable base-complex can be formulated associating, labeling, each mesh...

Starting from the triangle mesh of a digital shape, that is, mainly an articulated object, we produce coarse quad layout can be used in character modeling and animation. Our follows intrinsic object structure described by its curve skeleton; it contains few irregular vertices low degree; immediately refined into semiregular mesh; provides structured domain for UV mapping parametrization. method is fast, one-click, does not require any parameter setting. The user steer refine process through...

Abstract We propose a novel method for the automatic generation of structured hexahedral meshes articulated 3D shapes. recast complex problem generating connectivity mesh general shape into simpler tubular structure derived from its curve‐skeleton. also provide volumetric subdivision schemes to nicely adapt topology local thickness tubes, while regularizing per‐element size. Our is fast, one‐click, easy reproduce, and it generates that better align branching input if compared previous...

We introduce a novel algorithm to transform any generic set of triangles in 3D space into well-formed simplicial complex. Intersecting elements the input are correctly identified, subdivided, and connected arrange valid configuration, leading topologically sound partition piece-wise linear cells. Our approach does not require exact coordinates intersection points calculate resulting represent point as an unevaluated combination vertices. then extend recently introduced concept indirect...

Abstract Representing digital objects with structured meshes that embed a coarse block decomposition is relevant problem in applications like computer animation, physically‐based simulation and Computer Aided Design (CAD). One of the key ingredients to produce structures achieve good alignment between mesh singularities (i.e., corners each block). In this paper we improve on polycube‐based meshing pipeline both surface volumetric block‐structured general shapes. To aim add new step pipeline....

The recent development in consumer hardware lowers the cost barrier for adopting immersive Virtual Reality (VR) solutions, which could be an option classroom use near future. In this paper, we introduce RiftArt, a VR tool supporting teaching and studying of Art History. Using RiftArt teachers can configure virtual museum rooms, with artwork models inside, enhance them multimodal annotation. environment supports both during lesson students rehearsal. application, implemented completely using...

We propose a novel algorithm for decomposing general three-dimensional geometries into small set of overlap-free height-field blocks , volumes enclosed by flat base and surface defined with respect to this base. This decomposition is useful fabrication methodologies such as 3-axis CNC milling, where single milling pass can only carve the machine tray but also benefit other settings. Computing our desired requires solving highly constrained discrete optimization problem, variants which are...

The decreasing hardware cost makes it affordable to pair Immersive Virtual Environments (IVR) visors with treadmills and exercise bikes. In this paper, we discuss the application of different gamification techniques in IVR for supporting physical exercise. We describe both setting design Rift-a-bike, a cycling fitmersive game (immersive games fitness). evaluate effectiveness such through user study, which provides insights on their designing applications.

Since the introduction of standard techniques for isosurface extraction from volumetric datasets, one hardest problems has been to reduce number triangles (or polygons) generated. The paper presents an algorithm that considerably reduces polygons generated by a Marching Cubes-like scheme (W. Lorensen and H. Cline, 1987) without excessively increasing overall computational complexity. assumes discretization dataset space replaces cell edge interpolation midpoint selection. Under these...

Curve-skeletons are the most important descriptors for shapes, capable of capturing in a synthetic manner relevant features. They useful many different applications: from shape matching and retrieval, to medical imaging, animation. This has led, over years, development several techniques extraction, each trying comply with specific goals. We propose novel technique which stems intuition reproducing what human being does deduce an object holding it his or her hand rotating. To accomplish...

Abstract Hexahedral meshes generated from polycube mapping often exhibit a low number of singularities but also poor‐quality elements located near the surface. It is thus necessary to improve overall mesh quality, in terms minimum scaled Jacobian (MSJ) or average SJ (ASJ). Improving quality may be obtained via global padding (or pillowing), which pushes inside by adding an extra layer hexahedra on entire domain boundary. Such operation suffers large increase complexity, with unnecessary...

Representing digital objects with structured meshes that embed a coarse block decomposition is relevant problem in applications like computer animation, physically-based simulation and Computer Aided Design (CAD). One of the key ingredients to produce structures achieve good alignment between mesh singularities (i.e., corners each block). In this paper we improve on polycube-based meshing pipeline both surface volumetric block-structured general shapes. To aim add new step pipeline. Our goal...

Due to their nice numerical properties, conforming hexahedral meshes are considered a prominent computational domain for simulation tasks. However, the automatic decomposition of general 3D volume into small number elements is very challenging. Methods that create an adaptive Cartesian grid and convert it mesh offer superior robustness only ones concretely used in industry. Topological schemes permit this conversion can be applied if precise compatibility conditions among observed. Some...

Abstract In this study is presented a general algorithm for computing Voronoi volumes of atoms group in condensed phases. The method essentially an extension the Medvedev procedure to allow vertice determination any polyhedron, primitive or with degenerate vertices. has been employed time‐averaged hydrated crystal met‐myoglobin, using data molecular dynamics simulation. results, compared previous volume myoglobin, emphasize fundamental role solvent structure close protein surface relation...

We propose QuadMixer, a novel interactive technique to compose quad mesh components preserving the majority of original layouts. Quad Layout is crucial property for many applications since it conveys important information that would otherwise be destroyed by techniques aim only at shape. Our keeps untouched all quads in patches which are not involved blending. first perform robust boolean operations on corresponding triangle meshes. Then we use this result identify and build new surface...