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

ACM SIGGRAPH 2008 Classes

作者： Rhyne, Theresa-Marie Center for Visualization and Analytics Department of Computer Science Renaissance Computing Institute's Engagement Facility Raleigh

来源：评论

学校读者我要写书评

暂无评论

On the Rique Number of Series-Parallel Graphs and Planar Bipartite Graphs 2nd

On the Rique Number of Series-Parallel Graphs and Planar ...

引用

2nd International Conference on Applied Algorithms, ICAA 2025

作者： Azgor, Sk Ruhul Rahman, Md. Saidur Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka Bangladesh

ISBN: (纸本)9783031845420

The restricted input queue (rique) is a data structure which is recently introduced to study linear layout of graphs. The rique data structure is a special queue where insertions occur only at the head and removals occur at both the head and the tail. Considering a rique data structure the goal of a linear layout of a graph is to find a linear order of the vertices of the graph and a partition of its edges into pages such that the edges in each page follow the restriction of rique in the underlying order. The rique number of a graph is the smallest number of pages required for linear layout of the graph with rique data structure. A characterization of graphs for admitting a single page rique layout and some bounds on the rique number of complete and complete bipartite graphs are known. In this paper, we show that the rique number of series-parallel graphs as well as planar bipartite graphs is 2. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Combining Stable Diffusion and Object Detection for Semi-automatic Environment Decoration 41st

Combining Stable Diffusion and Object Detection for Semi-a...

引用

41st computer Graphics International Conference, CGI 2024

作者： Drescher, Philipp Ruprecht, Irena Settgast, Volker Computer Graphics and Knowledge Visualization Graz University of Technology Graz Austria Fraunhofer Austria Research GmbH Graz Austria

ISBN: (纸本)9783031820236

Enhancing immersive environments in an efficient way is essential across various industries. However, the task of selecting and placing suitable objects to decorate 3D scenes often requires a substantial investment of time and expertise. We present a novel semi-automatic approach to accelerate this process by fusing state-of-the-art generative text-to-image models with object detection. We use a rendering of a plain 3D scene as input for Stable Diffusion and generate an image depicting a decorated version. With object detection, we identify the location, size and class of decorative elements in the generated image. Based on this information, we populate the original 3D scene with matching assets from a database. Our results demonstrate the capabilities of our proposed approach in enhancing 3D scenes through the incorporation of decorative models across different scenarios. We show that our method seamlessly integrates into existing 3D content creation tools highlighting its applicability within established workflows. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Architectural design

来源：评论

学校读者我要写书评

暂无评论

AURORA: Automated Unleash of 3D Room Outlines for VR Applications 19

AURORA: Automated Unleash of 3D Room Outlines for VR Applica...

引用

19th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry, VRCAI 2024

作者： Han, Huijun Liang, Yongqing Zhou, Yuanlong Wang, Wenping Rojas-Muñoz, Edgar J. Li, Xin Computer Science and Engineering Texas A and M University College StationTX United States College of Performance Visualization and Fine Arts Texas A and M University College StationTX United States

ISBN: (纸本)9798400713484

Creating realistic VR experiences is challenging due to the labor-intensive process of accurately replicating real-world details into virtual scenes, highlighting the need for automated methods that maintain spatial accuracy and provide design flexibility. In this paper, we propose AURORA, a novel method that leverages RGB-D images to automatically generate both purely virtual reality (VR) scenes and VR scenes combined with real-world elements. This approach can benefit designers by streamlining the process of converting real-world details into virtual scenes. AURORA integrates advanced techniques in image processing, segmentation, and 3D reconstruction to efficiently create realistic and detailed interior designs from real-world environments. The design of this integration ensures optimal performance and precision, addressing key challenges in automated indoor design generation by uniquely combining and leveraging the strengths of foundation models. We demonstrate the effectiveness of our approach through experiments, both on self-captured data and public datasets, showcasing its potential to enhance virtual reality (VR) applications by providing interior designs that conform to real-world positioning. © 2024 ACM.

关键词： Virtual environments

来源：评论

学校读者我要写书评

暂无评论

On the Twin-width of Outerplanar Graphs 17th

On the Twin-width of Outerplanar Graphs

引用

17th International Conference on Combinatorial Optimization and Applications, COCOA 2024

作者： Anwarul Azim, Muhammad Azgor, Sk Ruhul Sharmin, Sadia Rahman, Md. Saidur Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering Bangladesh University of Engineering and Technology (BUET) Dhaka 1205 Bangladesh

ISBN: (纸本)9789819644445

Twin-width is a recently introduced graph parameter that measures the similarity of a graph to a cograph. It is analogous to treewidth, which measures how similar a graph to a tree is. Many NP-hard problems are fixed-parameter tractable on graphs with bounded treewidth or twin-width. Twin-width is proven as a more general width parameter as it is bounded for all bounded treewidth graphs and beyond. For example, the treewidth and twin-width for planar graphs are O(n) and at most 8, respectively. Nonetheless, the twin-width bound for planar graphs is yet to be proven tight, and very little is known about the subclasses of planar graphs. In this paper, we focus on obtaining the tight bound of the twin-width of outerplanar graphs, a well-known subclass of planar graphs. We show that every outerplanar graph has twin-width at most 3, and there is an outerplanar graph with twin-width at least 3. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Fixed-parameter tractable Outerplanar graphs Twin-width

来源：评论

学校读者我要写书评

暂无评论

Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees 17th

Faster Algorithms for Grid and Layered Drawings of Plane ...

引用

17th International Conference on Combinatorial Optimization and Applications, COCOA 2024

作者： Hossain, Ahmed Islam, Md. Hasanul Mondal, Debajyoti Rahman, Md. Saidur Graph Drawing and Information Visualization Laboratory Department of Computer Science and Engineering (CSE) Bangladesh University of Engineering and Technology (BUET) Dhaka Bangladesh Department of Computer Science University of Saskatchewan Saskatoon Canada

ISBN: (纸本)9789819644445

A grid drawing of a plane graph G is a planar drawing of G such that each vertex is mapped to an integer grid point and each edge is mapped to a straight line segment with the endpoints determined by its end vertices. The area of a grid drawing is the area of the smallest axis-aligned rectangle that encloses the drawing. A k-layer drawing of G is a planar drawing on a set L of k horizontal lines such that each vertex is mapped to a point on L and each edge is mapped to a straight line segment. A minimum area (minimum-layer) drawing of G is a straight-line grid (layered) drawing of G where the area (number of layers) is minimized. In this paper we examine the grid and layered drawing of a well-studied class of planar graphs called plane 3-tree. Given a n-vertex plane 3-tree, one can compute a straight line drawing with minimum number of layers or area in O(n⁵) and O(n⁹logn) time, respectively [Mondal et al., JGAA, 15(2), 2011]. Here we improve the running times to O(n³) and O(n⁷logn), respectively. We then give a fast approximation algorithm for computing minimum-layer drawings for a nontrivial subclass of plane 3-trees. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

visualization and the larger world of computer graphics: What's happening out there?

TR News

引用

TR News 2007年第252期 20-23页

作者： Rhyne, Theresa-Marie Center for Visualization and Analytics Department of Computer Science Renaissance Computing Institute's Engagement Facility North Carolina State University Raleigh

来源：评论

学校读者我要写书评

暂无评论

PraK Tool V3: Enhancing Video Item Search Using Localized Text and Texture Queries 31st

PraK Tool V3: Enhancing Video Item Search Using Localized Te...

引用

31st International Conference on Multimedia Modeling, MMM 2025

作者： Stroh, Michael Kloda, Vojtěch Verner, Benjamin Vopálková, Zuzana Buchmüller, Raphael Jäckl, Bastian Hajko, Jakub Lokoč, Jakub Visual Computing Department of Computer Science Faculty of Natural Sciences Konstanz University Konstanz Germany SIRET Research Group Department of Software Engineering Faculty of Mathematics and Physics Charles University Prague Czech Republic Data Analysis and Visualization Department of Computer Science Faculty of Natural Sciences Konstanz University Konstanz Germany

ISBN: (纸本)9789819620739

We present a third version of the PraK system designed around an effective text-image and image-image search model. The system integrates sub-image search options for localized context search for CLIP and image color/texture and interfaces tailored to specific task types. A user study shows the benefits of sub-image search in homogeneous video collections. We further enhance the user experience of the PraK framework by re-designing the frontend and introducing task-specific views. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Video analysis

来源：评论

学校读者我要写书评

暂无评论

Comment Analyzer: A Tool for Analyzing Comment Sets and Thread Structures of News Articles

引用

IEEE Transactions on visualization and computer Graphics 2025年 PP卷 PP页

作者： Kiesel, Dora Riehmann, Patrick Engelmann, Ines Ramezani, Hanna Froehlich, Bernd Bauhaus Universitat Weimar Virtual Reality and Visualization Group Germany Jönköping University Computer Science and Informatics Department School of Engineering Sweden Friedrich Schiller University Jena Empirical Methods of Communication Science Germany German Federal Agency for Civic Education Germany Bauhaus-Universitat Weimar Virtual Reality and Visualization Group Germany

The lack of visually guided data exploration tools limits the scope of research questions communication scientists are able to study. The Comment Analyzer steps in where traditional statistical tools fail when it comes to researching the commenting behavior of news article readers. The basis of such an analysis are comment-thread corpora in which comments are tagged with various deliberative quality indicators as well as political stance. Our analysis tool provides a visual querying system for the exploration and analysis of such corpora and allows social scientists to gain insights into the distributions and relations between comment attributes, the homogeneity of thread sets, frequent thread structures and changes in comment qualities over the course of a single but in particular of multiple threads at once. We developed the tool in close collaboration with communication scientists in a user-centered approach. The system has proven its utility in thorough reviews with the communication scientists, by corroborating existing findings in the literature but particularly by provoking and answering new research questions. Final reviews with five independent experts confirmed these observations and revealed the potential of the Comment Analyzer for other datasets currently being created and analyzed in the communication sciences © 1995-2012 IEEE.

关键词： Graph visualization Information visualization Multi-Attribute Aggregation Set-based visualization Text visualization Tree Aggregation Visual Text Analytics

来源：评论

学校读者我要写书评

暂无评论

SGLDBench: A Benchmark Suite for Stress-Guided Lightweight 3D Designs

arXiv

引用

arXiv 2025年

作者： Wang, Junpeng Bukenberger, Dennis R. Niedermayr, Simon Neuhauser, Christoph Wu, Jun Westermann, Rüdiger The Computer Graphics & Visualization Group Technische Universität München Garching Germany The Department of Sustainable Design Engineering Delft University of Technology Delft Netherlands

We introduce the Stress-Guided Lightweight Design Benchmark (SGLDBench), a comprehensive benchmark suite to apply and evaluate material layout strategies for generating stiff lightweight designs in 3D domains. SGLDBench provides a seamlessly integrated simulation and analysis framework, providing six reference strategies accompanied by a scalable multigrid elasticity solver to efficiently execute these strategies and validate the stiffness of their results. This facilitates systematic analysis and comparison of design strategies regarding the mechanical properties they achieve. SGLDBench enables the evaluation of diverse settings of load conditions and, through the tight integration of the solver, enables support for high-resolution designs and stiffness analysis. Moreover, SGLDBench emphasizes visual analysis to explore relations between the geometric structure of a design and the distribution of stresses, providing insights into the specific properties and behaviors of different design strategies. SGLDBenchs' specific features are highlighted in several experiments, by comparing the results of reference strategies with respect to geometric and mechanical properties. © 2025, CC BY.

关键词： Stiffness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：