Titlebook: Discrete and Computational Geometry; Japanese Conference, Jin Akiyama,Mikio Kano,Masatsugu Urabe Conference proceedings 2001 Springer-Verla

只看該作者 · 發(fā)表于 2025-3-30 16:58:24

On the Number of Views of Polyhedral Scenes, we close these gaps by improving the lower bounds. We construct an example of a scene .(....) orthographic views, and another with .(....) perspective views. Our construction can also be used to improve the known lower bounds for the number of silhouette views and for the number of distinct views from a viewpoint moving along a straight line.

只看該作者 · 發(fā)表于 2025-3-30 21:16:55

只看該作者 · 發(fā)表于 2025-3-31 02:50:27

只看該作者 · 發(fā)表于 2025-3-31 07:39:36

只看該作者 · 發(fā)表于 2025-3-31 10:13:05

只看該作者 · 發(fā)表于 2025-3-31 16:53:29

On double bound graphs with respect to graph operationsons. For example, The Cartesian product . × . of two graphs . and . is a DB-graph if and only if both . and . are bipartite graphs, the corona . o . of two graphs . and . is a DB-graph if and only if . is a bipartite graph and . is a UB-graph, and the middle graph . of a graph . is a DB-graph if and only if . is an even cycle or a path, etc.

只看該作者 · 發(fā)表于 2025-3-31 21:25:42

On Paths in a Complete Bipartite Geometric Graphtraight-line segment. We prove that (i) If |. (. + 1)(2. - 4)+1, then the geometric complete bipartite graph . contains a path that passes through all the points in . and has no crossings; and (ii) There exists a configuration of . ∪ . with . such that in . every path containing the set . has at least one crossing.

只看該作者 · 發(fā)表于 2025-3-31 23:43:19

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 16:37
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved