咨询与建议

限定检索结果

文献类型

  • 12 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 13 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 12 篇 工学
    • 12 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 7 篇 理学
    • 7 篇 数学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 13 篇 output-sensitive...
  • 2 篇 voronoi diagram
  • 2 篇 time complexity
  • 1 篇 polygon visibili...
  • 1 篇 subgraph listing
  • 1 篇 directed steiner...
  • 1 篇 dominance
  • 1 篇 shared segment
  • 1 篇 beta-skeleton
  • 1 篇 semi-structured ...
  • 1 篇 cell enumeration
  • 1 篇 junction vertex
  • 1 篇 additive weights
  • 1 篇 l-p metric
  • 1 篇 tree mining
  • 1 篇 maximum independ...
  • 1 篇 arrangements
  • 1 篇 shape of a point...
  • 1 篇 farthest hull
  • 1 篇 van emde boas tr...

机构

  • 2 篇 lund univ dept c...
  • 1 篇 univ minnesota d...
  • 1 篇 ibm corp thomas ...
  • 1 篇 univ econ fac fi...
  • 1 篇 univ waterloo de...
  • 1 篇 indian inst tech...
  • 1 篇 max planck inst ...
  • 1 篇 tu berlin fac 4 ...
  • 1 篇 natl inst inform...
  • 1 篇 natl inst inform...
  • 1 篇 univ texas dept ...
  • 1 篇 tarbiat modares ...
  • 1 篇 hosei univ
  • 1 篇 univ n carolina ...
  • 1 篇 univ windsor sch...
  • 1 篇 univ svizzera it...
  • 1 篇 univ econ fac in...
  • 1 篇 toyohashi univ t...
  • 1 篇 amirkabir univ t...
  • 1 篇 umea univ dept c...

作者

  • 2 篇 lingas andrzej
  • 1 篇 roayaei mehdy
  • 1 篇 zechner niklas
  • 1 篇 papadopoulou e
  • 1 篇 aichholzer o
  • 1 篇 razzazi mohammad...
  • 1 篇 snoeyink jack
  • 1 篇 gupta p
  • 1 篇 renken malte
  • 1 篇 arimura h
  • 1 篇 dasgupta b
  • 1 篇 papadopoulou eva...
  • 1 篇 cerny michal
  • 1 篇 chen dz
  • 1 篇 smid m
  • 1 篇 kurita kazuhiro
  • 1 篇 mukhopadhyay a
  • 1 篇 janardan r
  • 1 篇 rada miroslav
  • 1 篇 wasa kunihiro

语言

  • 9 篇 英文
  • 4 篇 其他
检索条件"主题词=output-sensitive algorithm"
13 条 记 录,以下是1-10 订阅
排序:
output-sensitive algorithm for computing β-skeletons
收藏 引用
COMPUTING 2000年 第3期65卷 285-289页
作者: Mukhopadhyay, A Rao, SV Univ Windsor Sch Comp Sci Windsor ON N9B 3P4 Canada Indian Inst Technol Dept Comp Sci & Engn Guwahati 781001 Assam India
The beta -skeleton is a measure of the internal shape of a planar set of points. We get an entire spectrum of shapes by varying the parameter beta. For a fixed value of beta, a beta -skeleton is a geometric graph obta... 详细信息
来源: 评论
A Fast output-sensitive algorithm for Boolean Matrix Multiplication
收藏 引用
algorithmICA 2011年 第1期61卷 36-50页
作者: Lingas, Andrzej Lund Univ Dept Comp Sci S-22100 Lund Sweden
We use randomness to exploit the potential sparsity of the Boolean matrix product in order to speed up the computation of the product. Our new fast outputsensitive algorithm for Boolean matrix product and its witnesse... 详细信息
来源: 评论
A NEW algorithm FOR ENUMERATION OF CELLS OF HYPERPLANE ARRANGEMENTS AND A COMPARISON WITH AVIS AND FUKUDA'S REVERSE SEARCH
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2018年 第1期32卷 455-473页
作者: Rada, Miroslav Cerny, Michal Univ Econ Fac Finance & Accounting Nam W Churchilla 4 Prague 13067 3 Czech Republic Univ Econ Fac Informat & Stat Nam W Churchilla 4 Prague 13067 3 Czech Republic
We design a new algorithm, called Incremental Enumeration (IncEnu), for the enumeration of full-dimensional cells of hyperplane arrangements (or dually, for the enumeration of vertices of generator-presented zonotopes... 详细信息
来源: 评论
Computing homotopic shortest paths in the plane
收藏 引用
JOURNAL OF algorithmS 2003年 第2期49卷 284-303页
作者: Bespamyatnikh, S Univ Texas Dept Comp Sci Richardson TX 75083 USA
We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. ... 详细信息
来源: 评论
Constant amortized time enumeration of Eulerian trails
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 923卷 1-12页
作者: Kurita, Kazuhiro Wasa, Kunihiro Natl Inst Informat Tokyo Japan Toyohashi Univ Technol Toyohashi Aichi Japan Hosei Univ Tokyo Japan
In this paper, we consider enumeration problems for edge-distinct and vertex-distinct Eulerian trails. Two Eulerian trails are said to be edge-distinctif the edge sequences are not identical, and they are said to be v... 详细信息
来源: 评论
Maximum independent set for intervals by divide and conquer with pruning
收藏 引用
NETWORKS 2007年 第2期49卷 158-159页
作者: Snoeyink, Jack Univ N Carolina Dept Comp Sci Chapel Hill NC 27599 USA
Suppose a given set of n intervals contains a maximum independent set of k disjoint intervals. This brief note demonstrates that "divide and conquer with pruning" produces an easy, output-sensitive O(n log k... 详细信息
来源: 评论
Skew Voronoi diagrams
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1999年 第3期9卷 235-247页
作者: Aichholzer, O Aurenhammer, F Chen, DZ Lee, DT Papadopoulou, E Graz Univ Technol Inst Theoret Comp Sci A-8010 Graz Austria IBM Corp Thomas J Watson Res Ctr Yorktown Heights NY 10598 USA
On a tilted plane T in three-space, skew distances are defined as the Euclidean distance plus a multiple of the signed difference in height. Skew distances may model realistic environments more closely than the Euclid... 详细信息
来源: 评论
A Fast Shortest Path algorithm on Terrain-like Graphs
收藏 引用
DISCRETE & COMPUTATIONAL GEOMETRY 2021年 第2期66卷 737-750页
作者: Froese, Vincent Renken, Malte TU Berlin Fac 4 Algorithm & Computat Complex Berlin Germany
Terrain visibility graphs are a well-known graph class in computational geometry. They are closely related to polygon visibility graphs, but a precise graph-theoretical characterization is still unknown. Over the last... 详细信息
来源: 评论
Efficient algorithms for Subgraph Listing
收藏 引用
algorithmS 2014年 第2期7卷 243-252页
作者: Zechner, Niklas Lingas, Andrzej Umea Univ Dept Comp Sci S-90187 Umea Sweden Lund Univ Dept Comp Sci S-22100 Lund Sweden
Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing co... 详细信息
来源: 评论
ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 2013年 第6期23卷 443-459页
作者: Papadopoulou, Evanthia Dey, Sandeep Kumar Univ Svizzera Italiana Fac Informat Lugano Switzerland
The farthest line-segment Voronoi diagram illustrates properties surprisingly different from its counterpart for points: Voronoi regions may be disconnected and they are not characterized by convex-hull properties. In... 详细信息
来源: 评论