Feature Extraction and Classification from Boundary Representation
|
| Title | Feature Extraction and Classification from Boundary Representation |
| Authors | |
| Abstract | In the paper, an algorithm for explicit feature extraction and classification from boundary representation is presented. It operates in two phases: the topological and the geometrical. While the topological part is just an adaptation of an already known algorithm, the geometrical part represents an original and new solution. In this part, the algorithm manipulates with features filled by material and the empty ones. The algorithm classifies extracted features into eight classes. It successfully and efficiently handles voids, nested features and many cases of mutual feature intersections. The time complexity depends on input data, and never exceeds O(n^2). |
| Publisher | University of Zagreb, University Computing Centre - SRCE |
| Date | 1970-01-01 |
| Source | Journal of Computing and Information Technology Vol 11, No 1 (2003) |
| Rights | CIT. Journal of Computing and Information Technology is an open access journal.Authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). |