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

Conflict neutralization on binary space partitioning

COMPUTER GRAPHICS FORUM 2000年第2期19卷 153-163页

作者： James, A Day, AM Univ E Anglia Sch Informat Syst Norwich NR4 7TJ Norfolk England

The binary space partitioning (BSP) tl ee achieves fast hidden surface removal for most practical applications where an observer can move through a scene of static objects. However, the BSP algorithm generally increases the number of polygons in a scene due to its splitting stage resulting in a detrimental effect on the priority orderig and more significantly, the display calculations (shading, lighting, shadows, etc.) of the rendering pipeline. We present the Conflict Neutralization algorithm which attempts to reduce the number of splits more effectively than existing techniques whilst maintaining the 'standard' model of a BSP tree. Our idea is similar to Conflict minimization proposed by Fuchs;the significant difference is that our algorithm recognizes that a polygon suitable for selection in the Minimization criterion may subsequently stop the remainder of polygons achieving some reductions in cuts-with Conflict Neutralization, such a polygon is demoted. We compare the results of Conflict Neutralization against Conflict Minimization, the Least-crossed with Most-crossed tie-breaking criterion and our own, enhanced implementation of Conflict Minimization. We show how these techniques fall into different 'depths of analysis'.

关键词： binary space partitioning conflict minimization hidden surface removal scene clustering

来源：评论

学校读者我要写书评

暂无评论

BSP-fields: An exact representation of polygonal objects by differentiable scalar fields based on binary space partitioning

引用

COMPUTER-AIDED DESIGN 2011年第3期43卷 265-277页

作者： Fryazinov, Oleg Pasko, Alexander Adzhiev, Valery Bournemouth Univ Poole BH12 5BB Dorset England

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary: no extra zero-value isosurfaces should be generated;C-1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions to the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of the function-based modeling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples. (c) 2010 Elsevier Ltd. All rights reserved.

关键词： Implicit surfaces Boundary representation Function representation binary space partitioning BSP-field Exact conversion

来源：评论

学校读者我要写书评

暂无评论

Learning Mesh Representations via binary space partitioning Tree Networks

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2023年第4期45卷 4870-4881页

作者： Chen, Zhiqin Tagliasacchi, Andrea Zhang, Hao Simon Fraser Univ Burnaby BC V5A 1S6 Canada Google Brain Toronto ON M5H 2G4 Canada

Polygonal meshes are ubiquitous, but have only played a relatively minor role in the deep learning revolution. State-of-the-art neural generative models for 3D shapes learn implicit functions and generate meshes via expensive iso-surfacing. We overcome these challenges by employing a classical spatial data structure from computer graphics, binary space partitioning (BSP), to facilitate 3D learning. The core operation of BSP involves recursive subdivision of 3D space to obtain convex sets. By exploiting this property, we devise BSP-Net, a network that learns to represent a 3D shape via convex decomposition without supervision. The network is trained to reconstruct a shape using a set of convexes obtained from a BSP-tree built over a set of planes, where the planes and convexes are both defined by learned network weights. BSP-Net directly outputs polygonal meshes from the inferred convexes. The generated meshes are watertight, compact (i.e., low-poly), and well suited to represent sharp geometry. We show that the reconstruction quality by BSP-Net is competitive with those from state-of-the-art methods while using much fewer *** also explore variations to BSP-Net including using a more generic decoder for reconstruction, more general primitives than planes, as well as training a generative model with variational auto-encoders.

关键词： Shape Three-dimensional displays Image reconstruction Semantics Geometry Training Solid modeling Neural representation of 3D shapes polygonal mesh binary space partitioning convex decomposition

来源：评论

学校读者我要写书评

暂无评论

Acceleration of Reflection in 2D Ray Tracing Based on Image by binary space partitioning 17

Acceleration of Reflection in 2D Ray Tracing Based on Image ...

引用

17th IEEE Biennial Conference on Electromagnetic Field Computation (IEEE CEFC)

作者： Lyu, Pengfei Xu, Xiaoyu Yan, Shuai Ren, Zhuoxiang Chinese Acad Sci Inst Microelect Beijing Peoples R China Beijing Key Lab 3D & Nano IC Elect Design Automat Beijing Peoples R China UPMC Univ Paris 06 Sorbonne Univ L2E UR2 Paris France

ISBN: (纸本)9781509010325

binary space partitioning (BSP) is one of the most successful method of acceleration of ray tracing in computer graphics. BSP is applied in the ray tracing coupled with Geometrical Optics (GO) in the modeling of wireless propagation. The performance of acceleration by BSP is investigated. Then the result of GO accelerated by BSP is compared with a full-wave electromagnetic simulating method, Finite Difference Time Domain (FDTD).

关键词： ray tracing image method binary space partitioning acceleration

来源：评论

学校读者我要写书评

暂无评论

An Exact Representation of Polygonal Objects by C¹-continuous Scalar Fields Based on binary space partitioning

An Exact Representation of Polygonal Objects by <i>C</i><SUP...

引用

IEEE International Conference on Shape Modeling and Applications

作者： Fryazinov, Oleg Pasko, Alexander Adzhiev, Valery Bournemouth Univ Natl Ctr Comp Animat Poole BH12 5BB Dorset England

ISBN: (纸本)9781424440689

The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zero value exactly at the polygonal object boundary;no extra zero-value isosurfaces should be generated;C-1 continuity of the function in the entire domain. The proposed algorithms are based on the binary space partitioning (BSP) of the object by the planes passing through the polygonal faces and are independent of the object genus, the number of disjoint components, and holes in the initial polygonal mesh. Several extensions of the basic algorithm are proposed to satisfy the selected optimization criteria. The generated BSP-fields allow for applying techniques of the function-based modelling to already existing legacy objects from CAD and computer animation areas, which is illustrated by several examples.

关键词： Implicit surfaces Boundary representation Function representation binary space partitioning BSP-field Exact Conversion

来源：评论

学校读者我要写书评

暂无评论

Identifying Mass-based local anomalies using binary space partitioning 15

Identifying Mass-based local anomalies using Binary Space Pa...

引用

15th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob)

作者： Ghaddar, Alia Darwish, Lama Yamout, Fadi Int Univ Beirut BIU LIU Beirut Lebanon

ISBN: (纸本)9781728133164

The performance of WSNs relies on the quality of the collected data. One of the main challenges is how to efficiently deliver the sensed measurements to the destination with a maximum fidelity to the probed data. Data measured by sensors require an efficient ranking measure to differentiate between normal and anomalous values. In this paper, we propose a local anomaly detector algorithm that uses Half-space trees to train and test data instances. It is based on mass ranking with difference in the way we score data and isolate anomalies. Experimental results show that our algorithm has better performance with high accuracy, low time and space complexity comparing to Local Outlier Factor and Mass estimation.

关键词： Anomaly Detection binary space partitioning Half-space Tree Mass estimation LOF Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

Enhancing the SliceNBound Algorithm for the Closest-Pairs Query with binary space partitioning 25

Enhancing the SliceNBound Algorithm for the Closest-Pairs Qu...

引用

25th Pan-Hellenic Conference on Informatics with International Participation (PCI)

作者： Mavrommatis, George Moutafis, Panagiotis Corral, Antonio Hellen Open Univ Patras Greece Univ Thessaly Dept Elect & Comp Engn Volos Greece Univ Almeria Dept Informat Almeria Spain

ISBN: (纸本)9781450395557

Given two datasets P and Q, the (K) Closest-Pairs Query, KCPQ, finds the (K) pairs of objects between the datasets with the least distance. In a previous work, we presented SliceNBound, a fast distributed algorithm for the KCPQ on Apache Spark, consisting of four phases. The algorithm partitions the datasets in slices across an axis. Since it is well known that proper partitioning of the datasets directly affects the running time of every algorithm, in a subsequent work we tested and evaluated variations of the binary space partitioning (BSP) for solving the KCPQ and found that this technique achieves better performance. In this paper we present an improvement of our distributed algorithm SliceNBound which consists in using a BSP scheme to create the partitions of data and reducing the samplings to one. The experiments show that this technique significantly reduces the total running time of the algorithm, thus improving an already fast and efficient algorithm.

关键词： Closest-Pairs Query Apache Spark binary space partitioning

来源：评论

学校读者我要写书评

暂无评论

Enhancing the SliceNBound Algorithm for the Closest-Pairs Query with binary space partitioning 2021

Enhancing the SliceNBound Algorithm for the Closest-Pairs Qu...

引用

25th Pan-Hellenic Conference on Informatics

作者： George Mavrommatis Panagiotis Moutafis Antonio Corral Hellenic Open University Greece University of Thessaly Greece Department of Informatics University of Almeria Spain

ISBN: (纸本)9781450395557

关键词： Apache Spark binary space partitioning Closest-Pairs Query

来源：评论

学校读者我要写书评

暂无评论

Blending weight BSP Tree for mesh Boolean operations

引用

COMPUTER-AIDED DESIGN 2025年 182卷

作者： Zhang, Hangcheng Song, Tianqi Zhang, Ganxuan Dai, Kai Wang, Le Liu, Yi Yang, Yi-Jun Zeng, Wei Xi An Jiao Tong Univ Sch Comp Sci & Technol Xian Peoples R China Xi An Jiao Tong Univ Sch Math & Stat Xian Peoples R China

Boolean operations play an important role in geometry processing and CAD/ CAM. To accelerate it, spatial searching trees such as binary space partitioning (BSP) Trees and KD-trees are utilized. In this paper, an approach is presented to construct the BSP Trees for the Boolean operation, where each model is efficiently located in a separate subspace. Unlike conventional methods to calculate the splitting plane, our method utilizes a size-distribution blending weighted squared distance in the BSP Tree construction, where the intrinsic weight is determined based on the size and distribution of the three-dimensional (3D) model and largely reflects the model shape. After determining the intrinsic size-distribution blending weighted squared distance, the effective splitting plane is calculated using the Weighted Squared Distance Minimization (WSDM) method. By utilizing the size-distribution blending weighted squared distance, the generated BSP Tree can divide the two models efficiently, even when dealing with 3D models that exhibit substantial geometric variations. In our experiments, the BSP Tree generated by our method reaches higher Intersecting Triangle Report Accuracy (ITRA) and Non- intersecting Triangles Removal Rate (NTRR), which means more efficient hierarchies than other techniques on two mesh models. The results of intersection tests time consumption and the Boolean operations demonstrate the effectiveness and efficiency of the BSP Tree generated by our method.

关键词： Boolean operation binary space partitioning Squared Distance Minimization Geometric algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient adaptive space partitioning algorithm for electromagnetic scattering calculation of complex 3D models

引用

Journal of Systems Engineering and Electronics 2021年第5期32卷 1071-1082页

作者： HUANG Minjie ZHOU Yaoming WANG Yongchao LIU Zhongtie School of Aeronautic Science and Engineering Beihang UniversityBeijing 100191China Key Laboratory of Complex Aviation System Simulation Beijing 100076China

The space partitioning algorithm based on the rounding and addressing operations has been proved to be an efficient space partitioning algorithm with the potential for real-time *** improvement on this kind of space partitioning algorithms for solving complex 3D models is *** examples show that the efficiency of the improved algorithm is better than that of the original *** the size of most target elements is smaller than the size of spatial grids,the efficiency of the improved method can be more than four times of that of the original *** adaptive method of space partitioning based on the improved algorithm is developed by taking the surface element density or the curvature as the threshold for deep partitioning and conducting the deep partitioning using the octree method.A computer program implementation for applying the method in some typical applications is discussed,and the performance in terms of the efficiency,reliability,and resource use is *** testing shows that the results of the adaptive spacing partitioning are more convenient for the follow-up use than that of the basic uniform space ***,when it is used to calculate the electromagnetic scattering of complex targets by the ray tracing(RT)method,the adaptive space partitioning algorithm can reduce the calculation time of the RT process by more than 40%compared with the uniform space segmentation algorithm.

关键词： adaptive space partitioning computer graphics binary space partitioning ray tracing(RT)method stealth technology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：