Isabel Navazo

Solid representation and operation using extended octrees

Solid modelers must be based on reliable and fast algorithms for Boolean operations. The octree model, as well as several generalizations (polytrees, integrated polytrees, extended octrees), is specially well suited for these algorithms and can be used either as a primary or as a secondary model in solid modeling systems. This paper is concerned with a precise definition of the extended octree model that allows the representation of nonmanifold objects with planar faces and, consequently, is closed under Boolean operations on polyhedrons. Boolean nodes and nearly vertex nodes are introduced, and the model is discussed in comparison with related representations. A fast algorithm for the direct generation of the extended octree from the geometry of the base polygon in extrusion solids is presented, and its complexity is studied. Boolean operation algorithms are introduced.

Integrating occlusion culling and levels of detail through hardly-visible sets

Occlusion culling and level‐of‐detail rendering have become two powerful tools for accelerating the handling of very large models in real‐time visualization applications. We present a framework that combines both techniques to improve rendering times. Classical occlusion culling algorithms compute potentially visible sets (PVS), which are supersets of the sets of visible polygons. The novelty of our approach is to estimate the degree of visibility of each object of the PVS using synthesized coarse occluders. This allows to arrange the objects of each PVS into several Hardly‐Visible Sets (HVS) with similar occlusion degree. According to image accuracy and frame rate requirements, HVS provide a way to avoid sending to the graphics pipeline those objects whose pixel contribution is low due to partial occlusion. The image error can be bounded by the user at navigation time. On the other hand, as HVS offer a tighter estimation of the pixel contribution for each scene object, it can be used for a more convenient selection of the level‐of‐detail at which objects are rendered. In this paper, we describe the new framework technique, provide details of its implementation using a visibility octree as the chosen occlusion culling data structure and show some experimental results on the image quality.

The Visibility octree. A data structure for 3D navigation

Abstract This paper describes the visibility octree, a data structure to accelerate 3D navigation through very complex scenes. A conservative visibility algorithm that computes and hierarchically stores the structure at a preprocessing stage is presented. The Visibility Octree is used during navigation and its main contribution is its ability to provide an effective control over the coarseness of the visibility approximation. Tests with indoor ship scenes show that the visibility octree performs well on densely occluded environments.

A geometric modeller based on the exact octtree representation of polyhedra

Geometric Modellers based on a Boundary Representation scheme are well suited for display operations, but boolean operations require algorithms with quadratic complexity. Using a class of extended octtrees which is presented here, boolean operations become linear, while exact recomputation of the boundary model in the case of polyhedral objects is possible, and memory requirements are less than in classical octtree encodings. Some bounds on the memory savings are given and discussed. The DMI system, a Geometric Modeller based on a hybrid model Boundary ‐ Extended Octtrees, is presented, discussing the main operations and the interface between both models. Some modelling examples are shown. Finally, a generalization of the extended octtree encoding which allows the exact representation of objects limited by sculptured surfaces is presented.

Omni‐directional Relief Impostors

Relief impostors have been proposed as a compact and high‐quality representation for high‐frequency detail in 3D models. In this paper we propose an algorithm to represent a complex object through the combination of a reduced set of relief maps. These relief maps can be rendered with very few artifacts and no apparent deformation from any view direction. We present an efficient algorithm to optimize the set of viewing planes supporting the relief maps, and an image‐space metric to select a sufficient subset of relief maps for each view direction. Selected maps (typically three) are rendered based on the well‐known ray‐height‐field intersection algorithm implemented on the GPU. We discuss several strategies to merge overlapping relief maps while minimizing sampling artifacts and to reduce extra texture requirements. We show that our representation can maintain the geometry and the silhouette of a large class of complex shapes with no limit in the viewing direction. Since the rendering cost is output sensitive, our representation can be used to build a hierarchical model of a 3D scene.

LOD visibility culling and occluder synthesis

Level-of-detail occlusion culling is a novel approach to the management of occluders that can be easily integrated into most current visibility culling algorithms. The main contribution of this paper is an algorithm that automatically generates sets of densely overlapping boxes with enhanced occlusion properties from non-convex subsets. We call this method occluder synthesis because it is not sensitive to the way the objects are tesselated but to the space enclosed by them. The extension of this technique by allowing a bounded amount of image error is also discussed. We show that visibility computations can be based on a multiresolution model which provides several representations of these occluders with varying visibility accuracy. Our tests show that occlusion performance in tesselated scenes is improved severely even if no image-error is allowed.

Extended Octtree representation of general solids with plane faces: model structure and algorithms

Abstract The Octtree encoding is an alternative representation scheme for solid objects that allows very simple algorithms for Boolean set operations. Extended Octtrees, which contain three extra node types (Face, Edge and Vertex) in addition to the classical nodes, inherit this advantage while being much more compact and allowing the exact representation of polyhedral objects. In the first part of this paper, the initial Extended Octtree model is generalized in order to support general vertices with n faces. After this, specific algorithms for the Boolean operations and Octtree visualization are presented. In particular, the algorithm for Boolean set operations is simple and treats all particular cases; it is based on the direct computation of the result of the operation between terminal nodes in a set of simple situations, while more complex cases are treated by subdivision. Some examples are presented, and the performance of the implemented algorithm is discussed.

Abdominothoracic Mechanisms of Functional Abdominal Distension and Correction by Biofeedback

BACKGROUND & AIMS In patients with functional gut disorders, abdominal distension has been associated with descent of the diaphragm and protrusion of the anterior abdominal wall. We investigated mechanisms of abdominal distension in these patients. METHODS We performed a prospective study of 45 patients (42 women, 24-71 years old) with functional intestinal disorders (27 with irritable bowel syndrome with constipation, 15 with functional bloating, and 3 with irritable bowel syndrome with alternating bowel habits) and discrete episodes of visible abdominal distension. Subjects were assessed by abdominothoracic computed tomography (n = 39) and electromyography (EMG) of the abdominothoracic wall (n = 32) during basal conditions (without abdominal distension) and during episodes of severe abdominal distension. Fifteen patients received a median of 2 sessions (range, 1-3 sessions) of EMG-guided, respiratory-targeted biofeedback treatment; 11 received 1 control session before treatment. RESULTS Episodes of abdominal distension were associated with diaphragm contraction (19% ± 3% increase in EMG score and 12 ± 2 mm descent; P < .001 vs basal values) and intercostal contraction (14% ± 3% increase in EMG scores and 6 ± 1 mm increase in thoracic antero-posterior diameter; P < .001 vs basal values). They were also associated with increases in lung volume (501 ± 93 mL; P < .001 vs basal value) and anterior abdominal wall protrusion (32 ± 3 mm increase in girth; P < .001 vs basal). Biofeedback treatment, but not control sessions, reduced the activity of the intercostal muscles (by 19% ± 2%) and the diaphragm (by 18% ± 4%), activated the internal oblique muscles (by 52% ± 13%), and reduced girth (by 25 ± 3 mm) (P ≤ .009 vs pretreatment for all). CONCLUSIONS In patients with functional gut disorders, abdominal distension is a behavioral response that involves activity of the abdominothoracic wall. This distension can be reduced with EMG-guided, respiratory-targeted biofeedback therapy.

Hoops: 3D Curves as Conservative Occluders for Cell-Visibility

Most visibility culling algorithms require convexity of occluders. Occluder synthesis algorithms attempt to construct large convex occluders inside bulky non‐convex sets. Occluder fusion algorithms generate convex occluders that are contained in the umbra cast by a group of objects given an area light. In this paper we prove that convexity requirements can be shifted from the occluders to their umbra with no loss of efficiency, and use this property to show how some special non‐planar, non‐convex closed polylines that we call “hoops” can be used to compute occlusion efficiently for objects that have no large interior convex sets and were thus rejected by previous approaches.

Optimizing the topological and combinatorial complexity of isosurfaces

Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of isosurfaces. Most approaches divide the 3D space into cubes that each occupy the space between eight neighboring samples of a regular lattice. The portion of the isosurface inside a cube may be computed independently of what happens in the other cubes, provided that the constructions for each pair of neighboring cubes agree along their common face. The portion of the isosurface associated with a cube may consist of one or more connected components, which we call sheets. The topology and combinatorial complexity of the isosurface is influenced by three types of decisions made during its construction: (1) how to connect the four intersection points on each ambiguous face, (2) how to form interpolating sheets for cubes with more than one loop, and (3) how to triangulate each sheet. To determine topological properties, it is only relevant whether the samples are inside or outside the object, and not their precise value, if there is one. Previously reported techniques make these decisions based on local-per cube-criteria, often using precomputed look-up tables or simple construction rules. Instead, we propose global strategies for optimizing several topological and combinatorial measures of the isosurfaces: triangle count, genus, and number of shells. We describe efficient implementations of these optimizations and the auxiliary data structures developed to support them.