oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Mesh Simplification for 3D Models with Feature-Preserving
支持外观属性保持的三维网格模型简化

LU Wei,ZENG Ding-Hao,PAN Jin-Gui,
卢威
,曾定浩,潘金贵

软件学报 , 2009,
Abstract: This paper analyzes current mesh simplification methods, and proposes a algorithm based on the quadric error metric (QEM) for feature preserving. It adopts a Half-edge collapse method for mesh simplification and modifies QEM to remove the discontinuities of appearance attributes. By analyzing the relationships between vertices and the discrete appearance seam, a new formula is obtained which enables the edge contraction to postpone the appearance; meanwhile a proper replacer is selected for the wedge in the...
Feature Preserving Mesh Simplification Using Feature Sensitive Metric
Jin Wei,Student Member,CCF,ACM,Yu Lou,ACM Tsinghua National Laboratory for Information Science,Technology,
魏瑨
,楼宇

计算机科学技术学报 , 2010,
Abstract: We present a new method for feature preserving mesh simplification based on feature sensitive (FS) metric. Previous quadric error based approach is extended to a high-dimensional FS space so as to measure the geometric distance together with normal deviation. As the normal direction of a surface point is uniquely determined by the position in Euclidian space, we employ a two-step linear optimization scheme to effciently derive the constrained optimal target point. We demonstrate that our algorithm can prese...
A New Method of Mesh Simplification Algorithm Based on QEM  [PDF]
Z. Tang,S. Yan,C. Lan
Information Technology Journal , 2010,
Abstract: With the data increasing of 3D mesh models, in order to meet the needs of the real-time processing, the mesh models need to be simplified. The QEM is one of typical method for mesh simplification, but it only considered the distance metric, so the mesh and vertex distributing even, it is unfavorable to simplify the mesh having jags. In order to keep the important shape features and reduce visual distortion effectively at low levels of detail, in this study, we improved the QEM algorithm. First, we introduced the concept of back-cost and embed back-cost into the original garland’s quadric error metric; second, we take the midpoint of contraction edge as the new vertex. The improved algorithm can not only measure distance error but also reflect geometric variations of local surface, the features of original models are well maintained. Meanwhile, new vertices are created at middle points; it is intuitional and simple than the original algorithm.
Interference Aware Channel Assignmnet Using Edge Coloring in Multi-Channel Multi-Radio Wireless Mesh Networks  [PDF]
Sarasvathi V,N. CH. S. N. Iyengar,Snehanshu Saha
Computer Science , 2013,
Abstract: Recently multi-channel multi-radio wireless mesh networks are considered a reliable and cost effective way for internet access in wide area. A major research challenge in this network is selecting least interference channel from available channel and then assigning it to radio efficiently. Many algorithms and methods have been developed for channel assignment to maximize network throughput using orthogonal channels. Recent research and testbed experiments proved that POC based channel assignment allows more flexibility in wireless spectrum sharing. In this paper, we represent the channel assignment as a graph edge coloring problem using POC. The signal-to-noise interference ratio is measured to avoid interference from neighbouring transmission, when we assign channel to link. Simulation result shows that our proposed method improves network throughput and performance. Keywords: Wireless Mesh Networks, Multi-Radio, Multi-Channel, Partially Overlapping Channels, Signal-to-noise interference
Mesh Simplification Using Non-balance Binary Tree on Parameterization Plane
参数平面二叉树剖分网格简化

GUAN Dong-dong,GUAN Hua-yong,WANG jia-ye,
关东东
,关华勇,汪嘉业

中国图象图形学报 , 2006,
Abstract: A curvature adaptive algorithm is presented to simplify 3d meshes rapidly based on splitting of the parameterization plane. The original 3d mesh is mapped onto the parameterization plane. A planar gray-level distribution is constructed based on the curvature values of the vertices of the original mesh to proclaim the various sampling density requirements of the original mesh. An iteration algorithm is used to select the curvature adaptive resample vertices on the parametcrization plane to construct the simplified mesh. The parameterization plane is iteratively split into two parts with the same summation of the gray-level value in each step. A non-balance binary tree was constructed during the procedure of splitting. The resample vertices set is obtained by allocating one vertex in each leaf node, and those resampled vertices are triangulated to construct the simplified mesh. This algorithm is very fast and can preserve the detail very well.
Similar curvature edge collapse simplification based on octree
一种基于八叉剖分的近似曲率的边折叠简化算法*

ZHANG Guo,LIU Xu-min,
张果
,刘旭敏

计算机应用研究 , 2010,
Abstract: To improve the speed of triangle mesh simplification, achieve the requirement of real-time display, and reserve more important shape features in the low-level model, the paper presented an improved triangle mesh simplification algorithm. It used octree structure to divide the triangle mesh model into different areas, and then used similar curvature edge-collapse simplification algorithm to simplify each area in parallel. The experimental results show that the improved algorithm obtains a better effect.
A New Algorithm for Mesh Simplification Based on the Importance of the Vertex
可减少模型简化误差的边折叠简化算法及应用

WANG Jian HE Ming-Yi,
王健
,何明一

计算机科学 , 2004,
Abstract: We propose a mesh simplification algorithm based on the importance of the vertex of edge. This algorithm can measure geometric error for surface features. We adopt a kind of data structure-an array structure. During the processing of the mesh simplification, a binary tree is adopted to achieve quick sort.Test demonstrates that this algorithm is simple and efficient; the simplification models have smaller geometric errors than previous works.
A Survey on Mesh Simplification
网格模型化简综述

HE Hui-guang,TIAN Jie,ZHANG Xiao-peng,ZHAO Ming-chang,LI Guang-ming,
何晖光
,田捷,张晓鹏,赵明昌,李光明

软件学报 , 2002,
Abstract: Mesh simplification is very important for storage, transmission, process, and real-time rendering. In this paper, the mesh simplification techniques are detailed and the typical methods are analyzed. The outlook of the future work is also given in the end.
Edge collapse simplification based on similar curvature
一种基于近似曲率的边折叠简化算法

ZHANG Guo,LIU Xu-min,GUAN Yong,
张果
,刘旭敏,关永

计算机应用 , 2009,
Abstract: To reserve more important shape features in the low-level model,an improved edge-collapse triangle mesh simplification algorithm was presented.On the basis of Garland's simplification algorithm,the concept of similar curvature was introduced and embedded into the original Garland's quadric error metric,so that the metric can not only measure distance error but also reflect geometric variations of local surface.The experimental results show that the improved algorithm effectively retains the detail character...
View-Dependent Extraction of Contours with Distance Transforms for Adaptive Polygonal Mesh Simplification
Susana Mata,Luis Pastor,Angel Rodríguez
Journal of Virtual Reality and Broadcasting , 2007,
Abstract: During decades Distance Transforms have proven to be useful for many image processing applications, and more recently, they have started to be used in computer graphics environments. The goal of this paper is to propose a new technique based on Distance Transforms for detecting mesh elements which are close to the objects' external contour (from a given point of view), and using this information for weighting the approximation error which will be tolerated during the mesh simplification process. The obtained results are evaluated in two ways: visually and using an objective metric that measures the geometrical difference between two polygonal meshes.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.