Fascinating and elegant shapes may be folded from a single planar sheet of material without stretching, tearing or cutting, if one incorporates curved folds into the design. We present an optimization-based computational framework for design digital reconstruction surfaces which can produced by folding. Our work not only contributes to applications in architecture industrial design, but it also provides new way study complex largely unexplored phenomena arising

Abstract We present Easy Mesh Cutting, an intuitive and easy‐to‐use mesh cutout tool. Users can cut meaningful components from meshes by simply drawing freehand sketches on the mesh. Our system provides instant visual feedback to obtain cutting results based improved region growing algorithm using a feature sensitive metric. The boundary be automatically optimized or easily edited users. Extensive experimentation shows that our approach produces good while requiring little skill effort user...

Blue noise point sampling is one of the core algorithms in computer graphics. In this paper, we present a new and versatile variational framework for generating distributions with high-quality blue characteristics while precisely adapting to given density functions. Different from previous approaches based on discrete settings capacity-constrained Voronoi tessellation, cast generation as problem continuous settings. Based an accurate evaluation gradient energy function, efficient...

This article presents a new method to optimally partition geometric domain with capacity constraints on the partitioned regions. It is an important problem in many fields, ranging from engineering economics. known that capacity-constrained can be obtained as power diagram squared L2 metric. We present super-linear convergence for computing optimal outperforms state-of-the-art order of magnitude. demonstrate efficiency our context three different applications computer graphics and processing:...

Abstract Packing problems arise in a wide variety of practical applications. The basic problem is that placing as many objects possible non‐overlapping configuration within given container. Problems involving irregular shapes are the most challenging cases. In this paper, we consider general forms shape packing 3D space, where both containers and can be any shapes, free rotations allowed. We propose heuristic method for efficiently by combining continuous optimization combinatorial...

This paper proposes a new algorithm to generate graded three-dimensional tetrahedral mesh. It revisits the class of methods based on optimal Delaunay triangulation (ODT) and proper way injecting background density function into objective minimized by ODT. continuous/analytic point view leads an that is continuous consistent, in contrast with discrete/geometrical developed previous work. To optimize function, this hybrid combines local search (quasi-Newton) global optimization (simulated...

Mosaics are widely used for surface decoration to produce appealing visual effects. We present a method synthesizing digital mosaics with irregularly shaped tiles, which type of tiles often design. Our employs both continuous optimization and combinatorial improve tile arrangement. In the step, we iteratively partition base into approximate Voronoi regions optimize positions orientations achieve tight fit. Combination performs permutation replacement further increase coverage diversify...

Vector image representation methods that can faithfully reconstruct objects and color variations in a raster are desired many practical applications. This article presents triangular configuration B-spline (referred to as TCB-spline)-based vector graphics for vectorization. Based on this new representation, an automatic vectorization paradigm is proposed. The proposed framework first detects sharp curvilinear features the constructs knot meshes based detected feature lines. It iteratively...

Abstract We develop a novel isotropic remeshing method based on constrained centroidal Delaunay mesh (CCDM), generalization of patch triangulation from 2D to surface. Our starts with resampling an input vertex distribution according user‐defined density function. The initial result is then progressively optimized by alternatively recovering the and moving each centroid its 1‐ring neighborhood. key making such simple iterations work efficient optimization framework that combines both local...

Autonomous orbit determination of a navigation constellation is the process by which parameters satellites are autonomously calibrated onboard without need for external aids. It commonly uses satellite data processing unit and filtering method to measurements inter-satellite ranges. The main module autonomous systems. In this paper, two factors that affect accuracy discussed first, then distributed algorithm proposed. This based on long-term ephemeris prediction suitable hardware capability....

A new method is presented for producing photo collages that preserve content correlation of photos. We use deep learning techniques to find among given photos facilitate their embedding on the canvas, and develop an efficient combinatorial optimization technique make correlated stay close each other. To canvas space, our first extracts salient regions packs only these regions. allow have arbitrary shapes, therefore yielding informative, yet more compact than by other similar collage methods...

Poisson disk sampling is an important problem in computer graphics and has a wide variety of applications imaging, geometry, rendering, etc. In this paper, we propose novel algorithm based on packing. The key idea uses the observation that relatively dense packing layout naturally satisfies distribution property each point no closer to others than specified minimum distance, i.e., radius. We use relaxation achieves good balance between random uniform properties needed for distributions. Our...