| Title: | New method for geometric constraint solving based on the genetic quantum algorithm |
| Authors: | Chunhong, Cao Li, Wenhui |
| Citation: | WSCG '2004: Posters: The 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, 2.-6. February 2004, Plzen, p. 65-68. |
| Issue Date: | 2004 |
| Publisher: | UNION Agency |
| Document type: | konferenční příspěvek conferenceObject |
| URI: | http://wscg.zcu.cz/wscg2004/Papers_2004_Poster/Q47.pdf http://hdl.handle.net/11025/940 |
| ISBN: | 80-903100-6-0 |
| Keywords: | řešení geometrických vazeb;geometrický rozklad;genetický kvantový algoritmus |
| Keywords in different language: | geometric constraints;geometric decomposing;genetic quantum algorithm |
| Abstract: | This paper proposes a novel genetic quantum algorithm (GQA) to solve geometric constraint problems. Instead of binary, numeric or symbolic representation, we introduce qubit chromosome representation. GQA is based on qubit and superposition of states and is used in the process of geometric constraint solving in order to get the solution sequence. As GQA has diversity caused by the qubit representation, there is no need to use the genetic operator. Qubit chromosome can be updated by proper quantum gate in the circulation. The experiment indicates GQA can solve the geometric constraint problem effectively. |
| Rights: | © UNION Agency |
| Appears in Collections: | WSCG '2004: Posters |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/940Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.