arrow
返回

Rasterized Planar Face Complex

delete2017-09-01
delete1
delete
OA
AI
G
Guillaume Damiand *
J
Jarek Rossignac
DOI:10.1016/j.cad.2017.05.010delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
We consider a Planar Face Complex (PFC). It is defined by the immersion of a planar and connected graph G, which comprises a set of vertices joined by curved edges. G decomposes the plane into faces that need not be manifold or open-regularized and may be bounded by a single loop edge. The PFC may, for example, be used to represent the complex street network of a city, the decomposition of a continent into countries, or the inhomogeneous structure made of a large set of regions of different materials possibly with internal cracks. The rasterized Planar Face Complex (rPFC) proposed here provides a compact representation of an approximation of a PFC, where the precise location of each vertex is quantized to the pixel that contains it and where the precise geometry of each curved edge is approximated by the ordered list (with possible repetitions) of the pixels traversed by (a chosen polygonal approximation of) the edge. We claim three key contributions: (1) The geometric error between a PFC and its rPFC is bounded by the pixel half-diagonal. (2) In spite of such a drastic discretization of the geometry, the rPFC captures the exact topology of the original PFC (provided that no street lies entirely inside a single pixel) and supports standard graph traversal operators that permit to walk the loop of sidewalks along the streets that bound a face, to cross a street to the opposite sidewalk, or to cross streets in order while walking around their common junction, (3) The local connectivity and order information needed to provide the above functionality is stored at each pixel using only about 4 bits per crossing. We discuss the details of this representation, our implementation of its exact construction, four possible embodiments that offer different space time efficiency compromises, experimental results, relations between rPFC and prior solutions. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Planar polygonal meshes
Combinatorial maps
Compact representation
Topology preserving rasterization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computer-Aided Design
IF:
3.1
论文数:
3.2K
被引数:
7.8K

机构

C
centre national de la recherche scientifique cnrs
学者数:
2
论文数: 1
被引数: 0
I
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Dual Loops Meshing: Quality Quad Layouts on Manifolds
err2012-07-01
err78
PREAI
errCampen, Marcel; Bommes, David; Kobbelt, Leif
err分享
err收藏
err分享
err收藏
Strong immobilization of charge carriers near the surface of a solid oxide electrolyte
err2010-01-01
err0
PREAI
errSangtae Kim; Pragati Jain; Hugo J. Avila-Paredes; Andrew Thron; Klaus van Benthem; Sabyasachi Sen
err分享
err收藏
Association between p47phox pseudogenes and inflammatory bowel disease
err2003-04-15
err0
PREAI
errMarcus Harbord; Andrea Hankin; Stuart Bloom; Hannah Mitchison
err分享
err收藏
Octave Spanning Mid-Infrared Frequency Comb Generation in Silicon Nanophotonic Wire Waveguides
err2014-01-01
err0
errOAAI
errBart Kuyken; Takuro Ideguchi; Simon Holzner; Ming Yan; Theodor W. Hänsch; Joris Van Campenhout; Peter Verheyen; Roel Baets; Gunther Roelkens; Nathalie Picqué
err分享
err收藏
学者 查看更多内容