File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Extreme points of a large 3D point set along multiple directions

TitleExtreme points of a large 3D point set along multiple directions
Authors
KeywordsBounding box
Cylindrical grid
Extreme points
Fitness
Issue Date2005
PublisherElsevier Ltd. The Journal's web site is located at http://www.elsevier.com/locate/cad
Citation
Cad Computer Aided Design, 2005, v. 37 n. 1, p. 17-34 How to Cite?
AbstractIn reverse engineering CAD modeling, a facet model is usually constructed from a large point cloud data which are obtained from a surface scanning process. The number of points in the point cloud data may range from hundred thousands to several millions depending on the user-defined precision. As a result, the facet model becomes very 'large' in terms of number of facets or vertices. The computational effort required to manipulate such a large set of data becomes enormous. This effort is significant even for some simple operations, e.g. rotating, scaling and translation. In this paper, an algorithm is proposed to determine the extreme points in a large 3D point set along multiple directions. This algorithm uses a cylindrical grid approximation technique to give both approximate solution and exact solution. This algorithm can be used to accelerate the computational process of some geometric problems on a large model, e.g., the minimum bounding box of a facet model [Comput Aid Des 20 (1988) 506; Comput Struct 79I (2001) 1433; Int J Comput Inform Sci 14 (1985) 183] and the 'fitness' problem of a model into a bounded volume [Comput Aid Des 20 (1988) 506]. © 2004 Elsevier Ltd. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/75595
ISSN
2015 Impact Factor: 2.149
2015 SCImago Journal Rankings: 1.078
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorChan, CKen_HK
dc.contributor.authorTan, STen_HK
dc.date.accessioned2010-09-06T07:12:43Z-
dc.date.available2010-09-06T07:12:43Z-
dc.date.issued2005en_HK
dc.identifier.citationCad Computer Aided Design, 2005, v. 37 n. 1, p. 17-34en_HK
dc.identifier.issn0010-4485en_HK
dc.identifier.urihttp://hdl.handle.net/10722/75595-
dc.description.abstractIn reverse engineering CAD modeling, a facet model is usually constructed from a large point cloud data which are obtained from a surface scanning process. The number of points in the point cloud data may range from hundred thousands to several millions depending on the user-defined precision. As a result, the facet model becomes very 'large' in terms of number of facets or vertices. The computational effort required to manipulate such a large set of data becomes enormous. This effort is significant even for some simple operations, e.g. rotating, scaling and translation. In this paper, an algorithm is proposed to determine the extreme points in a large 3D point set along multiple directions. This algorithm uses a cylindrical grid approximation technique to give both approximate solution and exact solution. This algorithm can be used to accelerate the computational process of some geometric problems on a large model, e.g., the minimum bounding box of a facet model [Comput Aid Des 20 (1988) 506; Comput Struct 79I (2001) 1433; Int J Comput Inform Sci 14 (1985) 183] and the 'fitness' problem of a model into a bounded volume [Comput Aid Des 20 (1988) 506]. © 2004 Elsevier Ltd. All rights reserved.en_HK
dc.languageengen_HK
dc.publisherElsevier Ltd. The Journal's web site is located at http://www.elsevier.com/locate/caden_HK
dc.relation.ispartofCAD Computer Aided Designen_HK
dc.subjectBounding boxen_HK
dc.subjectCylindrical griden_HK
dc.subjectExtreme pointsen_HK
dc.subjectFitnessen_HK
dc.titleExtreme points of a large 3D point set along multiple directionsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0010-4485&volume=37&issue=1&spage=17&epage=34&date=2005&atitle=Extreme+points+of+a+large+3D+point+set+along+multiple+directionsen_HK
dc.identifier.emailChan, CK: ckchan1@hku.hken_HK
dc.identifier.emailTan, ST: sttan@hku.hken_HK
dc.identifier.authorityChan, CK=rp00089en_HK
dc.identifier.authorityTan, ST=rp00174en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.cad.2004.02.010en_HK
dc.identifier.scopuseid_2-s2.0-4544307785en_HK
dc.identifier.hkuros95311en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-4544307785&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume37en_HK
dc.identifier.issue1en_HK
dc.identifier.spage17en_HK
dc.identifier.epage34en_HK
dc.identifier.isiWOS:000225426800002-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridChan, CK=55300876500en_HK
dc.identifier.scopusauthoridTan, ST=7403366758en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats