Person:
Rossignac,
Jarek
Rossignac,
Jarek
Permanent Link
Associated Organization(s)
Organizational Unit
ORCID
ArchiveSpace Name Record
67 results
Publication Search Results
Now showing
1  10 of 67

ItemSQUINT Fields, Maps, Patterns, and Lattices(Georgia Institute of Technology, 20180723) Rossignac, JarekThe proposed Steady QUad INTerpolating (SQUINT) map is formulated in terms of a SQUINT Field of Similarities (FoS). It is controlled by four coplanar points. It maps the unit square onto a curved planar quad, R, which has these points as corners. Uniformly spaced, logspiral isocurves decompose R into tiles that are similar to each other and, hence, each have equal angles at opposite corners. We provide closedform expressions for computing the representation of the SQUINT map and for evaluating the map and its inverse. We discuss extensions and potential applications to texture maps and field warps and to the design, display, and constantcost query of procedural models of arbitrarily complex lattices.

ItemPermutation Classifier(Georgia Institute of Technology, 20180424) Zhou, Xinrui ; Guerra, Concettina ; Rossignac, Jarek ; RossignacMilon, LeoWe consider permutations of a given set of n different symbols. We are given two unordered training sets, T1 and T2, of such permutations that are each assumed to contain examples of permutations of the corresponding type, t1 and t2. Our goal is to train a classifier, C(q), by computing a statistical model from T1 and T2, which, when given a candidate permutation, q, decides whether q is of type t1 or t2. We discuss two versions of this problem. The ranking version focuses on the order of the symbols. Our Separation Average Distance Matrix (SADiM) solution expands on previously proposed ranking aggregation formulations. The grouping version focuses on contiguity of symbols and hierarchical grouping. We propose and compare two solutions: (1) The Population Augmentation Ratio (PAR) solution computes a PQtree for each training set and uses a novel measure of distance between these and q that is based on ratios of population counts (i.e., of numbers of permutations explained by specific PQtrees). (2) The Difference of Positions (DoP) solution is computationally less expensive than PAR and is independent of the absolute population counts. Although DoP does not have the simple statistical grounding of PAR, our experiments show that it is consistently effective.

ItemRangeFinder: Accelerating ballinterference queries against steady lattices(Georgia Institute of Technology, 2018) Kurzeja, Kelsey ; Rossignac, JarekAdvances in additive manufacturing techniques are enabling the fabrication of new microstructures and materials. These may often be defined in terms of a set of balls and of beams that each connects two balls. To support application needs, we must support lattices with billions of such elements. To address this problem, we focus on architected and periodic structures in which the connectivity pattern repeats in three directions, and in which the positions and radii of the balls evolve through the structure in a prescribed and steady way that is defined by three similarity transforms. We propose here an algorithm that accelerates the BallInterference Query (BIQ), which establishes which elements of the lattice interfere with a query ball Q. Our RangeFinder (RF) solution reduces the asymptotic complexity of BIQs, which, in our tests, reduced the query time by a factor of between 45 and 5500. RF does not use any spatial occupancy data structure and can be trivially parallelized. We demonstrate the effectiveness of RangeFinder through the generation of multilevel lattices that we call LatticeinLattice (LiL).

ItemDesigning and processing parametric models of steady lattices( 2018) Gupta, Ashish ; Kurzeja, Kelsey ; Rossignac, Jarek ; Allen, George ; Kumar, Pranav Srinivas ; Musuvathy, SurajOur goal is to facilitate the design, analysis, optimization, and additive manufacturing of a specific class of 3D lattices that may comprise an extremely large number of elements. We target curved lattices that exhibit periodicity and uniform geometric gradations in three directions, along possibly curved axes. We represent a lattice by a simple computer program with a carefully selected set of exposed control parameters that may be used to adjust the overall shape of the lattice, its repetition count in each direction, its microstructure, and its gradation. In our ProgrammedLattice Editor (PLE), a typical lattice is represented by a short program of 10 to 50 statements. We propose a simple API and a few rudimentary GUI tools that automate the creation of the corresponding expressions in the program. The overall shape and gradation of the lattice is controlled by three similarity transformations. This deliberate design choice ensures that the gradation in each direction is regular (i.e., mathematically steady), that each cell can be evaluated directly, without iterations, and that integral properties (such as surface area, volume, center of mass and spherical inertia) can be obtained rapidly without having to calculate them for each individual element of the lattice.

ItemOptimized Blist Form (OBF)(Georgia Institute of Technology, 20070523) Rossignac, JarekAny Boolean expressions may be converted into positiveform, which has only union and intersection operators. Let E be a positiveform expression with n literals. Assume that the truthvalues of the literals are read one at a time. The numbers s(n) of steps (operations) and b(n) of working memory bits (footprint) needed to evaluate E depend on E and on the evaluation technique. A recursive evaluation performs s(n)=n–1 steps but requires b(n)=log(n)+1 bits. Evaluating the disjunctive form of E uses only b(n)=2 bits, but may lead to an exponential growth of s(n). We propose a new Optimized Blist Form (OBF) that requires only s(n)=n steps and b(n)=⌈log2j⌉ bits, where j=⌈log2(2n/3+2)⌉. We provide a simple and linear cost algorithm for converting positiveform expressions to their OBF. We discuss three applications: (1) Direct CSG rendering, where a candidate surfel stored at a pixel is classified against an arbitrarily complex Boolean expression using a footprint of only 6 stencil bits; (2) the new Logic Matrix (LM), which evaluates any positive form logical expression of n literals in a single cycle and uses a matrix of at most n×j wire/line connections; and (3) the new Logic Pipe (LP), which uses n gates that are connected by a pipe of ⌈log2j⌉ lines and when receiving a staggered stream of input vectors produces a value of a logical expression at each cycle.

ItemSimulation of Bubbles in Foam With The Volume Control Method(Georgia Institute of Technology, 2007) Kim, Byungmoon ; Liu, Yingjie ; Llamas, Ignacio ; Jiao, Xiangmin ; Rossignac, JarekLiquid and gas interactions often produce bubbles that stay for a long time without bursting on the surface, making a dry foam structure. Such long lasting bubbles simulated by the level set method can suffer from a small but steady volume error that accumulates to a visible amount of volume change. We propose to address this problem by using the volume control method. We track the volume change of each connected region, and apply a carefully computed divergence that compensates undesired volume changes. To compute the divergence, we construct a mathematical model of the volume change, choose control strategies that regulate the modeled volume error, and establish methods to compute the control gains that provide robust and fast reduction of the volume error, and (if desired) the control of how the volume changes over time.

ItemRinging Js refinements(Georgia Institute of Technology, 2007) Schaefer, Scott ; Rossignac, JarekBoth the fourpoint and the uniform cubic Bspline refinement (i.e. subdivision) schemes double the number of vertices of a closedloop polygonal curve jP and respectively produce sequences of vertices fk and bk. The Js refinement proposed here produces vertices vk=(1s)fk+sbk. Iterative applications of Js yield a family of curves parameterized by s. It includes the fourpoint curve (J0), the uniform cubic Bspline (J8/8), and the quintic Bspline (J12/8). Iterating Js converges to a C2 curve for 0[less than]s[less than]1, to a C3 curve for 1[less than or equal to]s[less than]3/2, and to a C4 curve for s=S3/2. J3/8 tends to reduce the error between consecutive refinements and is useful to reduce popping when switching levelsofdetail in multiresolution rendering. J4/8 produces the Jarek curve, which, in 2D, encloses a surface area that is usually very close to the area enclosed by the original control polygon 0P. We propose modeldependent and modelindependent optimizations for these parameter values. As other refinement schemes, the Js approach extends trivially to open curves, animations, and surfaces. To reduce memory requirements when evaluating the final refined curve, surface, or animation, we introduce a new evaluation technique, called Ringing. It requires a footprint of only 5 points per subdivision level for each curve and does not introduce any redundant calculations.

ItemMultiple Object Selection in Pattern Hierarchies(Georgia Institute of Technology, 2007) Jang, Justin ; Rossignac, JarekHierarchies of patterns of features, of subassemblies, or of CSG subexpressions are used in architectural and mechanical CAD to eliminate laborious repetitions from the design process. Yet, often the placement, shape, or even existence of a selection of the repeated occurrences in the pattern must be adjusted. The specification of a desired selection of occurrences in a hierarchy of patterns is often tedious (involving repetitive steps) or difficult (requiring interaction with an abstract representation of the hierarchy graph). The OCTOR system introduced here addresses these two drawbacks simultaneously, offering an effective and intuitive solution, which requires only two mouseclicks to specify any one of a wide range of possible selections. It does not require expanding the graph or storing an explicit list of the selected occurrences and is simple to compute. It is hence well suited for a variety of CAD applications, including CSG, featurebased design, assembly mockup, and animation. We discuss a novel representation of a selection, a technology that makes it possible to use only two mouseclicks for each selection, and the persistence of these selections when the hierarchy of patterns is edited.

ItemPressing: Smooth Isosurfaces with Flats from Binary Grids(Georgia Institute of Technology, 2007) Chica, Antonio ; Williams, Jason ; Andujar, Carlos ; Brunet, Pere ; Navazo, Isabel ; Rossignac, Jarek ; Vinacua, AlvarWe explore the automatic recovery of solids from their binary volumetric discretizations. In particular, we propose an approach, called Pressing, for smoothing isosurfaces extracted from binary volumes while recovering their large planar regions (flats). Pressing yields a surface that is guaranteed to contain the samples of the volume classified as interior and exclude those classified as exterior. It uses global optimization to identify flats and constrained bilaplacian smoothing to eliminate sharp features and highfrequencies from the rest of the isosurface. It recovers sharp edges between flat regions and between flat and smooth regions. Hence, the resulting isosurface is usually a very accurate approximation of the original solid. Furthermore, the segmentation of the isosurface into flat and curved faces and the sharp/smooth labelling of their edges may be valuable for shape recognition, simplification, compression, and various reverse engineering and manufacturing applications.

ItemBoundary of the Volume Swept By a Freeform Solid in Screw Motion(Georgia Institute of Technology, 2006) Rossignac, Jarek ; Kim, J. J. ; Song, S. C. ; Suh, K. C. ; Joung, C. B.The swept volume of a moving solid provides an excellent aid for path and accessibility planning in robotics and for simulating various manufacturing operations. To compute the boundary of the swept volume, we approximate the motion by a polyscrew (continuous, piecewisescrew), generate candidate faces, compute the twocells of their arrangement, and use a new pointinsweep test to select the correct cells whose union forms the boundary of the swept volume.