Recording medium, program and data structure for representing two- or three-dimensional object
A computer storage and data structure technology, which is applied in computing, electrical digital data processing, special data processing applications, etc., can solve the problems of low utilization of CAD system and low processing efficiency, and achieve the effect of easy rework and improved processing efficiency.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0198] An exemplary embodiment of the data structure according to the invention is explained in detail below.
[0199] Fig. 22 is a diagram showing a two-dimensional diagram for explanation of an example of a data structure according to the present invention. 1 in the figure is a 2D graph, and points V0, V1, V2, V3, V4, V5, V6, V7, V8, V9, V10, V11, V12, V13, and V14 are the points that constitute the 2D graph 1.
[0200] The data structure for storing the graph in the memory is a collection of a plurality of point data constituting the graph, and each point data holds information necessary for expressing the graph.
[0201] In FIG. 22, first, since the adjacent points of V0 are the points V1, V3, V6, and V7 connected by lines with V0, the adjacent points are left-handed in the point data of the point V0 and the points V1, V3, V6, and V7 are arranged. Record the address data V1, V3, V6, V7 of each point in sequence. The adjacent points V1, V3, V6, and V7 are also recorded in...
Embodiment 2
[0228] Next, an embodiment in the 3D graphics of the present invention will be described in detail.
[0229] FIG. 26 shows a three-dimensional graph, and points V0, V1, V2, V3, V4, V5, V6, and V7 are points constituting the graph 7 .
[0230] In the data structure of the present invention, the above-mentioned points are recorded as point data each holding information necessary for expressing a figure.
[0231] In graph 7 of FIG. 26, first, since the adjacent points of V0 are points V1, V3, and V4 connected with V0 by a straight line, the adjacent points are left-handed in the order of points V1, V3, and V4 in the point data of point V0. The address data V1, V3, and V4 of each point are sequentially recorded. The adjacent points V1, V3, and V4 are also recorded in the same manner. Among the adjacent points, a numerical value indicating which address data of point V0 is to be recorded is recorded in the point data of V0.
[0232] Although it is assumed here that the adjacent p...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com