Automatic comprehensive drawing method and system
The invention relates to an automatic comprehensive drawing method and system, and the method comprises the steps: obtaining representative points of polygons of projection planes of all houses, and forming a representative point cluster; based on the unconstrained Delaunay triangulation network mat...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | ZHENG LONG LI ZHENGBIN YANG YONG HE WEIJUN LI KAN ZHANG XIANFENG DU WEI LIU SHIHUA WANG LIESHENG YANG XIANLIAN LIU YANPENG ZHANG ZHENGQI LIU QIANZHONG |
description | The invention relates to an automatic comprehensive drawing method and system, and the method comprises the steps: obtaining representative points of polygons of projection planes of all houses, and forming a representative point cluster; based on the unconstrained Delaunay triangulation network mathematical model, constructing an associated triangulation network of the representative point cluster of the house projection plane, and constructing a minimum spanning tree for the associated triangulation network; cutting the minimum spanning tree to form at least one polygonal aggregation tree; extracting all vertexes of a house projection plane polygon in each polygon aggregation tree, generating a new associated triangulation network based on an unconstrained Delaunay triangulation network mathematical model, and performing triangulation based on constrained edges; and carrying out triangle fusion on the new associated triangulation network after constraint processing. The system comprises a representative poi |
format | Patent |
fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN115131526A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN115131526A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN115131526A3</originalsourceid><addsrcrecordid>eNrjZDB0LC3Jz00syUxWSM7PLShKzUjNK84sS1VIKUosz8xLV8hNLcnIT1FIzEtRKK4sLknN5WFgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8c5-hoamhsaGpkZmjsbEqAEAyU4sDg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Automatic comprehensive drawing method and system</title><source>esp@cenet</source><creator>ZHENG LONG ; LI ZHENGBIN ; YANG YONG ; HE WEIJUN ; LI KAN ; ZHANG XIANFENG ; DU WEI ; LIU SHIHUA ; WANG LIESHENG ; YANG XIANLIAN ; LIU YANPENG ; ZHANG ZHENGQI ; LIU QIANZHONG</creator><creatorcontrib>ZHENG LONG ; LI ZHENGBIN ; YANG YONG ; HE WEIJUN ; LI KAN ; ZHANG XIANFENG ; DU WEI ; LIU SHIHUA ; WANG LIESHENG ; YANG XIANLIAN ; LIU YANPENG ; ZHANG ZHENGQI ; LIU QIANZHONG</creatorcontrib><description>The invention relates to an automatic comprehensive drawing method and system, and the method comprises the steps: obtaining representative points of polygons of projection planes of all houses, and forming a representative point cluster; based on the unconstrained Delaunay triangulation network mathematical model, constructing an associated triangulation network of the representative point cluster of the house projection plane, and constructing a minimum spanning tree for the associated triangulation network; cutting the minimum spanning tree to form at least one polygonal aggregation tree; extracting all vertexes of a house projection plane polygon in each polygon aggregation tree, generating a new associated triangulation network based on an unconstrained Delaunay triangulation network mathematical model, and performing triangulation based on constrained edges; and carrying out triangle fusion on the new associated triangulation network after constraint processing. The system comprises a representative poi</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; IMAGE DATA PROCESSING OR GENERATION, IN GENERAL ; PHYSICS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220930&DB=EPODOC&CC=CN&NR=115131526A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20220930&DB=EPODOC&CC=CN&NR=115131526A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ZHENG LONG</creatorcontrib><creatorcontrib>LI ZHENGBIN</creatorcontrib><creatorcontrib>YANG YONG</creatorcontrib><creatorcontrib>HE WEIJUN</creatorcontrib><creatorcontrib>LI KAN</creatorcontrib><creatorcontrib>ZHANG XIANFENG</creatorcontrib><creatorcontrib>DU WEI</creatorcontrib><creatorcontrib>LIU SHIHUA</creatorcontrib><creatorcontrib>WANG LIESHENG</creatorcontrib><creatorcontrib>YANG XIANLIAN</creatorcontrib><creatorcontrib>LIU YANPENG</creatorcontrib><creatorcontrib>ZHANG ZHENGQI</creatorcontrib><creatorcontrib>LIU QIANZHONG</creatorcontrib><title>Automatic comprehensive drawing method and system</title><description>The invention relates to an automatic comprehensive drawing method and system, and the method comprises the steps: obtaining representative points of polygons of projection planes of all houses, and forming a representative point cluster; based on the unconstrained Delaunay triangulation network mathematical model, constructing an associated triangulation network of the representative point cluster of the house projection plane, and constructing a minimum spanning tree for the associated triangulation network; cutting the minimum spanning tree to form at least one polygonal aggregation tree; extracting all vertexes of a house projection plane polygon in each polygon aggregation tree, generating a new associated triangulation network based on an unconstrained Delaunay triangulation network mathematical model, and performing triangulation based on constrained edges; and carrying out triangle fusion on the new associated triangulation network after constraint processing. The system comprises a representative poi</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>IMAGE DATA PROCESSING OR GENERATION, IN GENERAL</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDB0LC3Jz00syUxWSM7PLShKzUjNK84sS1VIKUosz8xLV8hNLcnIT1FIzEtRKK4sLknN5WFgTUvMKU7lhdLcDIpuriHOHrqpBfnxqcUFicmpeakl8c5-hoamhsaGpkZmjsbEqAEAyU4sDg</recordid><startdate>20220930</startdate><enddate>20220930</enddate><creator>ZHENG LONG</creator><creator>LI ZHENGBIN</creator><creator>YANG YONG</creator><creator>HE WEIJUN</creator><creator>LI KAN</creator><creator>ZHANG XIANFENG</creator><creator>DU WEI</creator><creator>LIU SHIHUA</creator><creator>WANG LIESHENG</creator><creator>YANG XIANLIAN</creator><creator>LIU YANPENG</creator><creator>ZHANG ZHENGQI</creator><creator>LIU QIANZHONG</creator><scope>EVB</scope></search><sort><creationdate>20220930</creationdate><title>Automatic comprehensive drawing method and system</title><author>ZHENG LONG ; LI ZHENGBIN ; YANG YONG ; HE WEIJUN ; LI KAN ; ZHANG XIANFENG ; DU WEI ; LIU SHIHUA ; WANG LIESHENG ; YANG XIANLIAN ; LIU YANPENG ; ZHANG ZHENGQI ; LIU QIANZHONG</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN115131526A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2022</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>IMAGE DATA PROCESSING OR GENERATION, IN GENERAL</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>ZHENG LONG</creatorcontrib><creatorcontrib>LI ZHENGBIN</creatorcontrib><creatorcontrib>YANG YONG</creatorcontrib><creatorcontrib>HE WEIJUN</creatorcontrib><creatorcontrib>LI KAN</creatorcontrib><creatorcontrib>ZHANG XIANFENG</creatorcontrib><creatorcontrib>DU WEI</creatorcontrib><creatorcontrib>LIU SHIHUA</creatorcontrib><creatorcontrib>WANG LIESHENG</creatorcontrib><creatorcontrib>YANG XIANLIAN</creatorcontrib><creatorcontrib>LIU YANPENG</creatorcontrib><creatorcontrib>ZHANG ZHENGQI</creatorcontrib><creatorcontrib>LIU QIANZHONG</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ZHENG LONG</au><au>LI ZHENGBIN</au><au>YANG YONG</au><au>HE WEIJUN</au><au>LI KAN</au><au>ZHANG XIANFENG</au><au>DU WEI</au><au>LIU SHIHUA</au><au>WANG LIESHENG</au><au>YANG XIANLIAN</au><au>LIU YANPENG</au><au>ZHANG ZHENGQI</au><au>LIU QIANZHONG</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Automatic comprehensive drawing method and system</title><date>2022-09-30</date><risdate>2022</risdate><abstract>The invention relates to an automatic comprehensive drawing method and system, and the method comprises the steps: obtaining representative points of polygons of projection planes of all houses, and forming a representative point cluster; based on the unconstrained Delaunay triangulation network mathematical model, constructing an associated triangulation network of the representative point cluster of the house projection plane, and constructing a minimum spanning tree for the associated triangulation network; cutting the minimum spanning tree to form at least one polygonal aggregation tree; extracting all vertexes of a house projection plane polygon in each polygon aggregation tree, generating a new associated triangulation network based on an unconstrained Delaunay triangulation network mathematical model, and performing triangulation based on constrained edges; and carrying out triangle fusion on the new associated triangulation network after constraint processing. The system comprises a representative poi</abstract><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | |
ispartof | |
issn | |
language | chi ; eng |
recordid | cdi_epo_espacenet_CN115131526A |
source | esp@cenet |
subjects | CALCULATING COMPUTING COUNTING IMAGE DATA PROCESSING OR GENERATION, IN GENERAL PHYSICS |
title | Automatic comprehensive drawing method and system |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T16%3A55%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=ZHENG%20LONG&rft.date=2022-09-30&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN115131526A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |