检索结果-内蒙古大学图书馆

Terrain descriptors for landscape synthesis, analysis and simulation

COMPUTER GRAPHICS FORUM 2025年

作者： Argudo, O. Guerin, E. Schott, H. Galin, E. Univ Politecn Cataluna Barcelona Spain CNRS INSA Lyon LIRIS Lyon France Univ Lyon 1 CNRS LIRIS Villeurbanne France

Synthetic landscape generation is an active research area within Computer Graphics. Algorithms for terrain synthesis and ecosystem simulations often rely on simple descriptors such as slope, light accessibility, and drainage area. Typically, the results are assessed from a perceptual standpoint, focusing primarily on visual plausibility. Other fields, such as Geomorphology and Earth Sciences, have already proposed several analytical descriptors to measure various terrain properties. This work aims to bridge the gap between these disciplines and Computer Graphics. We provide a comprehensive review of commonly used terrain metrics that may be relevant for landscape synthesis, analysis, or simulations. Additionally, we compare the approaches used in Computer Graphics to see if these metrics, or similar ones, have already been introduced. Moreover, we report feedback from a preliminary study conducted with a group of artists to evaluate the potential applications of previously unused metrics. By implementing all these metrics, we enable performance comparisons. Together with the provided correlation matrix, this helps identify instances where a simpler and faster metric can serve as a proxy for a more computationally intensive one.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Global Texture Mapping for Dynamic Objects

引用

COMPUTER GRAPHICS FORUM 2019年第7期38卷 697-705页

作者： Kim, Jungeon Kim, Hyomin Park, Jaesik Lee, Seungyong POSTECH Pohang South Korea

We propose a novel framework to generate a global texture atlas for a deforming geometry. Our approach distinguishes from prior arts in two aspects. First, instead of generating a texture map for each timestamp to color a dynamic scene, our framework reconstructs a global texture atlas that can be consistently mapped to a deforming object. Second, our approach is based on a single RGB-D camera, without the need of a multiple-camera setup surrounding a scene. In our framework, the input is a 3D template model with an RGB-D image sequence, and geometric warping fields are found using a state-of-the-art non-rigid registration method [GXW*15] to align the template mesh to noisy and incomplete input depth images. With these warping fields, our multi-scale approach for texture coordinate optimization generates a sharp and clear texture atlas that is consistent with multiple color observations over time. Our approach is accelerated by graphical hardware and provides a handy configuration to capture a dynamic geometry along with a clean texture atlas. We demonstrate our approach with practical scenarios, particularly human performance capture. We also show that our approach is resilient on misalignment issues caused by imperfect estimation of warping fields and inaccurate camera parameters.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Accurate Synthesis of Multi-Class Disk Distributions

引用

COMPUTER GRAPHICS FORUM 2019年第2期38卷 157-168页

作者： Ecormier-Nocca, Pierre Memari, Pooran Gain, James Cani, Marie-Paule Ecole Polytech LIX Palaiseau France CNRS Paris France Univ Cape Town Cape Town South Africa

While analysing and synthesising 2D distributions of points has been applied both to the generation of textures with discrete elements and for populating virtual worlds with 3D objects, the results are often inaccurate since the spatial extent of objects cannot be expressed. We introduce three improvements enabling the synthesis of more general distributions of elements. First, we extend continuous pair correlation function (PCF) algorithms to multi-class distributions using a dependency graph, thereby capturing interrelationships between distinct categories of objects. Second, we introduce a new normalised metric for disks, which makes the method applicable to both point and possibly overlapping disk distributions. The metric is specifically designed to distinguish perceptually salient features, such as disjoint, tangent, overlapping, or nested disks. Finally, we pay particular attention to convergence of the mean PCF as well as the validity of individual PCFs, by taking into consideration the variance of the input. Our results demonstrate that this framework can capture and reproduce real-life distributions of elements representing a variety of complex semi-structured patterns, from the interaction between trees and the understorey in a forest to droplets of water. More generally, it applies to any category of 2D object whose shape is better represented by bounding circles than points.

关键词： CCS Concepts • Theory of computation → Randomness geometry and discrete structures • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Computational Design of Steady 3D Dissection Puzzles

引用

COMPUTER GRAPHICS FORUM 2019年第2期38卷 291-303页

作者： Tang, Keke Song, Peng Wang, Xiaofei Deng, Bailin Fu, Chi-Wing Liu, Ligang Guangzhou Univ Cyberspace Inst Adv Technol Guangzhou Guangdong Peoples R China Univ Hong Kong Hong Kong Peoples R China Ecole Polytech Fed Lausanne Lausanne Switzerland Univ Sci & Technol China Hefei Anhui Peoples R China Cardiff Univ Cardiff S Glam Wales Chinese Univ Hong Kong Hong Kong Peoples R China

Dissection puzzles require assembling a common set of pieces into multiple distinct forms. Existing works focus on creating 2D dissection puzzles that form primitive or naturalistic shapes. Unlike 2D dissection puzzles that could be supported on a tabletop surface, 3D dissection puzzles are preferable to be steady by themselves for each assembly form. In this work, we aim at computationally designing steady 3D dissection puzzles. We address this challenging problem with three key contributions. First, we take two voxelized shapes as inputs and dissect them into a common set of puzzle pieces, during which we allow slightly modifying the input shapes, preferably on their internal volume, to preserve the external appearance. Second, we formulate a formal model of generalized interlocking for connecting pieces into a steady assembly using both their geometric arrangements and friction. Third, we modify the geometry of each dissected puzzle piece based on the formal model such that each assembly form is steady accordingly. We demonstrate the effectiveness of our approach on a wide variety of shapes, compare it with the state-of-the-art on 2D and 3D examples, and fabricate some of our designed puzzles to validate their steadiness.

关键词： CCS Concepts • computing methodologies → shape modeling • Applied computing → Computer‐aided manufacturing

来源：评论

学校读者我要写书评

暂无评论

Out-of-core Extraction of Curve Skeletons for Large Volumetric Models

引用

COMPUTER GRAPHICS FORUM 2022年第7期41卷 1-12页

作者： Chu, Yiyao Wang, Wencheng Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China

Existing methods for skeleton extraction have limitations in terms of the amount of memory space available, as the model must be allocated to the random access memory. This challenges the treatment of out-of-core models. Although applying out-of-core simplification methods to the model can fit in memory, this would induce distortion of the model surface, and so causing the skeleton to be off-centered or changing the topological structure. In this paper, we propose an efficient out-of-core method for extracting skeletons from large volumetric models. The method takes a volumetric model as input and first computes an out-of-core distance transform. With the distance transform, we generate a medial mesh to capture the prominent features for skeleton extraction, which significantly reduces the data size and facilitates the process of large models. At last, we contract the medial mesh in an out-of-core fashion to generate the skeleton. Experimental results show that our method can efficiently extract high-quality curve skeletons from large volumetric models with small memory usage.

关键词： CCS Concepts • computing methodologies → shape modeling shape analysis

来源：评论

学校读者我要写书评

暂无评论

Fabricable Multi-Scale Wang Tiles

引用

COMPUTER GRAPHICS FORUM 2022年第5期41卷 149-159页

作者： Liu, Xiaokang Li, Chenran Lu, Lin Deussen, Oliver Tu, Changhe Shandong Univ Jinan Peoples R China Univ Konstanz Constance Germany

Wang tiles, also known as Wang dominoes, are a jigsaw puzzle system with matching edges. Due to their compactness and expressiveness in representing variations, they have become a popular tool in the procedural synthesis of textures, height fields, 3D printing and representing other large and non-repetitive data. Multi-scale tiles created from low-level tiles allow for a higher tiling efficiency, although they face the problem of combinatorial explosion. In this paper, we propose a generation method for multi-scale Wang tiles that aims at minimizing the amount of needed tiles while still resembling a tiling appearance similar to low-level tiles. Based on a set of representative multi-scale Wang tiles, we use a dynamic generation algorithm for this purpose. Our method can be used for rapid texture synthesis and image halftoning. Respecting physical constraints, our tiles are connected, lightweight, independent of the fabrication scale, able to tile larger areas with image contents and contribute to "mass customization".

关键词： CCS Concepts • computing methodologies → shape modeling • Applied computing → Computer-aided design

来源：评论

学校读者我要写书评

暂无评论

Multi-Pose Interactive Linkage Design

引用

COMPUTER GRAPHICS FORUM 2019年第2期38卷 277-289页

作者： Nishida, G. Bousseau, A. Aliaga, D. G. Purdue Univ W Lafayette IN 47907 USA INRIA Rocquencourt France

We introduce an interactive tool for novice users to design mechanical objects made of 2.5D linkages. Users simply draw the shape of the object and a few key poses of its multiple moving parts. Our approach automatically generates a one-degree-of freedom linkage that connects the fixed and moving parts, such that the moving parts traverse all input poses in order without any collision with the fixed and other moving parts. In addition, our approach avoids common linkage defects and favors compact linkages and smooth motion trajectories. Finally, our system automatically generates the 3D geometry of the object and its links, allowing the rapid creation of a physical mockup of the designed object.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Practical Foldover-Free Volumetric Mapping Construction

引用

COMPUTER GRAPHICS FORUM 2019年第7期38卷 287-297页

作者： Su, Jian-Ping Fu, Xiao-Ming Liu, Ligang Univ Sci & Technol China Hefei Anhui Peoples R China

In this paper, we present a practically robust method for computing foldover-free volumetric mappings with hard linear constraints. Central to this approach is a projection algorithm that monotonically and efficiently decreases the distance from the mapping to the bounded conformal distortion mapping space. After projection, the conformal distortion of the updated mapping tends to be below the given bound, thereby significantly reducing foldovers. Since it is non-trivial to define an optimal bound, we introduce a practical conformal distortion bound generation scheme to facilitate subsequent projections. By iteratively generating conformal distortion bounds and trying to project mappings into bounded conformal distortion spaces monotonically, our algorithm achieves high-quality foldover-free volumetric mappings with strong practical robustness and high efficiency. Compared with existing methods, our method computes mesh-based and meshless volumetric mappings with no prescribed conformal distortion bounds. We demonstrate the efficacy and efficiency of our method through a variety of geometric processing tasks.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Memory-Efficient Bijective Parameterizations of Very-Large-Scale Models

引用

COMPUTER GRAPHICS FORUM 2020年第7期39卷 1-12页

作者： Ye, Chunyang Su, Jian-Ping Liu, Ligang Fu, Xiao-Ming Univ Sci & Technol China Hefei Peoples R China

As high-precision 3D scanners become more and more widespread, it is easy to obtain very-large-scale meshes containing at least millions of vertices. However, processing these very-large-scale meshes is still a very challenging task due to memory limitations. This paper focuses on a fundamental geometric processing task, i.e., bijective parameterization construction. To this end, we present a spline-enhanced method to compute bijective and low distortion parameterizations for very-large-scale disk topology meshes. Instead of computing descent directions using the mesh vertices as variables, we estimate descent directions for each vertex by optimizing a proxy energy defined in spline spaces. Since the spline functions contain a small set of control points, it significantly decreases memory requirement. Besides, a divide-and-conquer method is proposed to obtain bijective initializations, and a submesh-based optimization strategy is developed to reduce distortion further. The capability and feasibility of our method are demonstrated over various complex models. Compared to the existing methods for bijective parameterizations of very-large-scale meshes, our method exhibits better scalability and requires much less memory.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

Precise High-order Meshing of 2D Domains with Rational Bezier Curves

引用

COMPUTER GRAPHICS FORUM 2022年第5期41卷 79-88页

作者： Yang, Jinlin Liu, Shibo Chai, Shuangming Liu, Ligang Fu, Xiao-Ming Univ Sci & Technol China Hefei Peoples R China

We propose a novel method to generate a high-order triangular mesh for an input 2D domain with two key characteristics: (1) the mesh precisely conforms to a set of input piecewise rational domain curves, and (2) the geometric map on each curved triangle is injective. Central to the algorithm is a new sufficient condition for placing control points of a rational Bezier triangle to guarantee that the conformance and injectivity constraints are theoretically satisfied. Taking advantage of this condition, we provide an explicit construct that robustly creates higher-order 2D meshes satisfying the two characteristics. We demonstrate the robustness and effectiveness of our algorithm over a data set containing 2200 examples.

关键词： CCS Concepts • computing methodologies → shape modeling

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：