http://rdf.ncbi.nlm.nih.gov/pubchem/patent/WO-02068899-A2
Outgoing Links
Predicate | Object |
---|---|
assignee | http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_1b8f7feddf3681aad8b396fd7c6fd8b8 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/B27B1-007 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G01N21-4795 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G01N21-47 http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/B27B1-00 |
filingDate | 2002-02-20-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
inventor | http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_e59de23352dd781c520d4084ed6662ff |
publicationDate | 2002-09-06-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | WO-02068899-A2 |
titleOfInvention | Log evaluation using cylindrical projections |
abstract | A three-dimensional density distribution of a log is reduced to a two-dimensional structure (205) that provides a convenient image or visualization of defects like knots (210) or voids (240) in a log, to facilitate grading and/or optimization of a sawing strategy for the log. The two-dimensional data structure is based on cylindrical or modified cylindrical coordinates Z and υ. To provide a more compact identification of defects, modified cylindrical coordinates use a Z-axis that follows the growth center (125) in the log and determines data points by evaluating properties of the log along rays at an upward angle (ζ) corresponding to limbs in a tree. A process for identifying the growth center at any distance Z along the length of the log examines or accumulates the gradient of density along lines through a cross-section of the log. Manual grading and sawing optimization can employ viewing of an image based on the two-dimensional data structure with superimposed marks indicating the boundaries of faces cut from the log. Automated grading and sawing optimization employs the two-dimensional data structure to reduce processing time when compared to processes that manipulate three-dimensional data structure. |
isCitedBy | http://rdf.ncbi.nlm.nih.gov/pubchem/patent/SE-2130345-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/DE-10254943-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/AT-521092-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/AT-521092-B1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/AU-2010224362-B2 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/DE-102010047499-A1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-7092484-B1 http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-107533034-A http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-107533034-B http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-109978995-A |
priorityDate | 2001-02-23-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 48.