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

7th Joint Eurographics - IEEE VGTC Symposium on Visualization, VisSym 2005

作者： Bruckner, Stefan Grimm, Sören Kanitsar, Armin Eduard Gröller, M. Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

ISBN: (纸本)3905673193

In volume rendering it is very difficult to simultaneously visualize interior and exterior structures while preserving clear shape cues. Very transparent transfer functions produce cluttered images with many overlapping structures, while clipping techniques completely remove possibly important context information. In this paper we present a new model for volume rendering, inspired by techniques from illustration that provides a means of interactively inspecting the interior of a volumetric data set in a feature-driven way which retains context information. The context-preserving volume rendering model uses a function of shading intensity, gradient magnitude, distance to the eye point, and previously accumulated opacity to selectively reduce the opacity in less important data regions. It is controlled by two user-specified parameters. This new method represents an alternative to conventional clipping techniques, shares their easy and intuitive user control, but does not suffer from the drawback of missing context information. © The Eurographics Association 2005.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LiteMaker: Interactive luminaire development using progressive photon tracing and multi-resolution upsampling

LiteMaker: Interactive luminaire development using progressi...

引用

2017 Conference on Vision, Modeling and Visualization, VMV 2017

作者： Krösl, Katharina Luksch, Christian Schwärzler, Michael Wimmer, Michael VRVis Research Center Austria TU Wien Institute of Computer Graphics and Algorithms Austria

ISBN: (纸本)9783038680499

Industrial applications like luminaire development (the creation of a luminaire in terms of geometry and material) or lighting design (the efficient and aesthetic placement of luminaires in a virtual scene) rely heavily on high realism and physically correct simulations. Using typical approaches like CAD modeling and offline rendering, this requirement induces long processing times and therefore inflexible workflows. In this paper, we combine a GPU-based progressive photon-tracing algorithm to accurately simulate the light distribution of a luminaire with a novel multi-resolution image-filtering approach that produces visually meaningful intermediate results of the simulation process. By using this method in a 3D modeling environment, luminaire development is turned into an interactive process, allowing for real-time modifications and immediate feedback on the light distribution. Since the simulation results converge to a physically plausible solution that can be imported as a representation of a luminaire into a light-planning software, our work contributes to combining the two former decoupled workflows of luminaire development and lighting design, reducing the overall production time and cost for luminaire manufacturers. © 2017 The Author(s).

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Auto splats: Dynamic point cloud visualization on the GPU

Auto splats: Dynamic point cloud visualization on the GPU

引用

12th Eurographics Symposium on Parallel graphics and Visualization, EG PGV 2012

作者： Preiner, Reinhold Jeschke, Stefan Wimmer, Michael Institute of Computer Graphics and Algorithms Vienna University of Technology Austria

ISBN: (纸本)9783905674354

Capturing real-world objects with laser-scanning technology has become an everyday task. Recently, the acquisition of dynamic scenes at interactive frame rates has become feasible. A high-quality visualization of the resulting point cloud stream would require a per-frame reconstruction of object surfaces. Unfortunately, reconstruction computations are still too time-consuming to be applied interactively. In this paper we present a local surface reconstruction and visualization technique that provides interactive feedback for reasonably sized point clouds, while achieving high image quality. Our method is performed entirely on the GPU and in screen space, exploiting the efficiency of the common rasterization pipeline. The approach is very general, as no assumption is made about point connectivity or sampling density. This naturally allows combining the outputs of multiple scanners in a single visualization, which is useful for many virtual and augmented reality applications. © The Eurographics Association 2012.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

An evolutionary algorithm for the maximum weight trace formulation of the multiple sequence alignment problem

引用

8th International Conference on Parallel Problem Solving from Nature, PPSN 2004

作者： Koller, Gabriele Raidl, Günther R. Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)3540230920

The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairwise alignments. We improve the alignment graph by adding more global information. A new construction heuristic and an evolutionary algorithm with specialized operators are proposed and compared to three other algorithms for the MSA, indicating the competitiveness of the new approaches. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Solving a real-world glass cutting problem

Solving a real-world glass cutting problem

引用

4th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2004

作者： Puchinger, Jakob Raidl, Gúnther R. Koller, Gabriele Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)3540213678

We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, and therefore the waste, is to be minimized. The cutting facility requires three-staged guillotineable cutting patterns, and in addition, a plan for loading produced elements on transportation wagons. The availability of only three loading docks for wagons imposes additional constraints on the feasibility of cutting patterns. We describe a greedy first fit heuristic, two branchand-bound based heuristics, and different variants of an evolutionary algorithm for the problem, and compare them on a set of real-world instances. The evolutionary algorithm is based on an order representation, specific recombination and mutation operators, and a decoding heuristic. In one variant, branch-and-bound is occasionally applied to locally optimize parts of a solution during decoding. © Springer-Verlag Berlin Heidelberg 2004. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

An evolutionary algorithm for column generation in integer programming: An effective approach for 2D bin packing

引用

8th International Conference on Parallel Problem Solving from Nature, PPSN 2004

作者： Puchinger, Jakob Raidl, Günther R. Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)3540230920

We consider the 3-stage two-dimensional bin packing problem, which occurs in real-world problems such as glass cutting. For it, we present a new integer linear programming formulation and a branch and price algorithm. Column generation is performed by applying either a greedy heuristic or an Evolutionary Algorithm (EA). Computational experiments show the benefits of the EA-based approach. The higher computational effort of the EA pays off in terms of better final solutions;furthermore more instances can be solved to provable optimality. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

An Integer L-shaped Method for the Generalized Vehicle Routing Problem with Stochastic Demands

引用

Electronic Notes in Discrete Mathematics 2016年 52卷 245-252页

作者： Biesinger, Benjamin Hu, Bin Raidl, Günther Institute of Computer Graphics and Algorithms TU Wien Favoritenstraße 9-11/1861 Vienna 1040 Austria

In this work we consider the generalized vehicle routing problem with stochastic demands (GVRPSD). This NP-hard problem combines the clustering aspect of the generalized vehicle routing problem with the uncertainty aspect of the vehicle routing problem with stochastic demands. We propose an integer L-shaped method based on decomposition and branch-and-cut. The subproblem of computing the restocking costs is based on dynamic programming. We consider the preventive restocking strategy which is substantially harder than the standard restocking strategy used by the majority of the published articles for stochastic vehicle routing problems. Using this strategy the vehicle can make a return trip to the depot even before an actual stockout occurs and therefore save travel time. The GVRPSD has not been considered in the literature so far and this first exact solution attempt proves to be able to solve small to medium instances. © 2016 Elsevier B.V.

关键词： Integer programming Stochastic optimization Vehicle routing problem

来源：评论

学校读者我要写书评

暂无评论

Information-based transfer functions for multimodal visualization

Information-based transfer functions for multimodal visualiz...

引用

1st Eurographics Workshop on Visual Computing and Biomedicine, EG VCBM 2008

作者： Haidacher, Martin Bruckner, Stefan Kanitsar, Armin Gröller, M. Eduard Institute of Computer Graphics and Algorithms Vienna University of Technology Austria AGFA HealthCare Vienna Austria

ISBN: (纸本)9783905674132

Transfer functions are an essential part of volume visualization. In multimodal visualization at least two values exist at every sample point. Additionally, other parameters, such as gradient magnitude, are often retrieved for each sample point. To find a good transfer function for this high number of parameters is challenging because of the complexity of this task. In this paper we present a general information-based approach for transfer function design in multimodal visualization which is independent of the used modality types. Based on information theory, the complex multi-dimensional transfer function space is fused to allow utilization of a well-known 2D transfer function with a single value and gradient magnitude as parameters. Additionally, a quantity is introduced which enables better separation of regions with complementary information. The benefit of the new method in contrast to other techniques is a transfer function space which is easy to understand and which provides a better separation of different tissues. The usability of the new approach is shown on examples of different modalities. © The Eurographics Association 2008.

关键词： Transfer functions

来源：评论

学校读者我要写书评

暂无评论

An efficient variable neighborhood search for solving a robust dynamic facility location problem in emergency service network

引用

Electronic Notes in Discrete Mathematics 2015年 47卷 261-268页

作者： Mišković, Stefan Stanimirović, Zorica Grujičić, Igor Faculty of Mathematics University of Belgrade Belgrade Serbia Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

In this study, we propose a robust variant of a dynamic facility location problem that arises from optimizing the emergency service network of Police Special Forces Units (PSFUs) in the Republic of Serbia. We present for the first time a mathematical programming formulation of the problem under consideration. We further propose a Variable Neighborhood Search (VNS) method with an efficient local search procedure for solving real-life problem instances that remained out of reach of CPLEX solver. The results presented in this paper may help in optimizing the network of PSFUs and other security networks as well. © 2014 Elsevier B.V.

关键词： Dynamic facility location Emergency service network Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

Contextual snapshots: Enriched visualization with interactive spatial annotations

Contextual snapshots: Enriched visualization with interactiv...

引用

29th Spring Conference on computer graphics, SCCG 2013

作者： Mindek, Peter Bruckner, Stefan Gröller, M. Eduard Institute of Computer Graphics and Algorithms Vienna University of Technology Austria Department of Informatics University of Bergen Norway

ISBN: (纸本)9781450324809

Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analyzed and compared in different views. However, the semantics of such selections are often dependent on other parameter settings and it can be difficult to reconstruct them without additional information. In this paper, we present the concept of contextual snapshots as an effective means for managing spatial selections in visualized data. The selections are automatically associated with the context in which they have been created. Contextual snapshots can be also used as the basis for interactive integrated and linked views, which enable in-place investigation and comparison of multiple visual representations of data. Our approach is implemented as a flexible toolkit with welldefined interfaces for integration into existing systems. We demonstrate the power and generality of our techniques by applying them to several distinct scenarios such as the visualization of simulation data and the analysis of historical documents. Copyright © 2013 by the Association for Computing Machinery, Inc.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：