Discret. Comput. Geom.最新文献_第10页

Embeddability of open-ended carbon nanotubes in hypercubes 开放式碳纳米管在超立方体中的可嵌入性

Discret. Comput. Geom. Pub Date : 2010-07-01 DOI: 10.1016/j.comgeo.2009.12.001

Heping Zhang, Guangfu Wang

引用次数: 6

Querying Two Boundary Points for Shortest Paths in a Polygonal Domain 在多边形域中查询两个边界点的最短路径

Discret. Comput. Geom. Pub Date : 2009-11-25 DOI: 10.1007/978-3-642-10631-6_106

S. Bae, Y. Okamoto

引用次数: 8

A general approach for cache-oblivious range reporting and approximate range counting 用于缓存无关范围报告和近似范围计数的通用方法

Discret. Comput. Geom. Pub Date : 2009-06-08 DOI: 10.1145/1542362.1542413

P. Afshani, Chris H. Hamilton, N. Zeh

{"title":"A general approach for cache-oblivious range reporting and approximate range counting","authors":"P. Afshani, Chris H. Hamilton, N. Zeh","doi":"10.1145/1542362.1542413","DOIUrl":"https://doi.org/10.1145/1542362.1542413","url":null,"abstract":"We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. The main contribution of our paper is a general approach for constructing cache-oblivious data structures that provide relative (1+ε)-approximations for a general class of range counting queries. This class includes three-sided range counting, 3-d dominance counting, and 3-d halfspace range counting. Our technique allows us to obtain data structures that use linear space and answer queries in the optimal query bound of O(logB(N/K)) block transfers in the worst case, where K is the number of points in the query range. Using the same technique, we also obtain the first approximate 3-d halfspace range counting and 3-d dominance counting data structures with a worst-case query time of O(log(N/K)) in internal memory.\u0000 An easy but important consequence of our main result is the existence of O(N log N)-space cache-oblivious data structures with an optimal query bound of O(logBN + K/B) block transfers for the reporting versions of the above problems. Using standard reductions, these data structures allow us to obtain the first cache-oblivious data structures that use near-linear space and achieve the optimal query bound for circular range reporting and K-nearest neighbour searching in the plane, as well as for orthogonal range reporting in three dimensions.","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"303 1","pages":"700-712"},"PeriodicalIF":0.0,"publicationDate":"2009-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76860838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 19

Randomly removing g handles at once 随机一次移除g个手柄

Discret. Comput. Geom. Pub Date : 2009-06-08 DOI: 10.1145/1542362.1542425

G. Borradaile, James R. Lee, Anastasios Sidiropoulos

引用次数: 14

On grids in topological graphs 论拓扑图中的网格

Discret. Comput. Geom. Pub Date : 2009-06-08 DOI: 10.1145/1542362.1542430

Eyal Ackerman, J. Fox, J. Pach, Andrew Suk

引用次数: 27

Non-manifold surface reconstruction from high-dimensional point cloud data 基于高维点云数据的非流形曲面重建

Discret. Comput. Geom. Pub Date : 2009-06-01 DOI: 10.1016/j.comgeo.2011.05.002

Shawn Martin, J. Watson

引用次数: 21

Towards a Definition of Higher Order Constrained Delaunay Triangulations 关于高阶约束Delaunay三角剖分的定义

Discret. Comput. Geom. Pub Date : 2009-05-01 DOI: 10.1016/j.comgeo.2008.09.005

Rodrigo I. Silveira, M. V. Kreveld

引用次数: 10

Translational packing of arbitrary polytopes 任意多面体的平移填充

Discret. Comput. Geom. Pub Date : 2009-05-01 DOI: 10.1016/j.comgeo.2008.06.003

J. Egeblad, Benny K. Nielsen, M. Brazil

引用次数: 61

Geometric dilation of closed curves in normed planes 赋范平面上闭合曲线的几何膨胀

Discret. Comput. Geom. Pub Date : 2009-05-01 DOI: 10.1016/j.comgeo.2008.06.001

H. Martini, Senlin Wu

引用次数: 11

Orthogonal equipartitions 正交均分

Discret. Comput. Geom. Pub Date : 2009-05-01 DOI: 10.1016/j.comgeo.2008.09.004

S. Bereg

引用次数: 12