WO2004097339A1 - Transformation d'ensemble de caracteristiques - Google Patents

Transformation d'ensemble de caracteristiques Download PDF

Info

Publication number
WO2004097339A1
WO2004097339A1 PCT/AU2004/000452 AU2004000452W WO2004097339A1 WO 2004097339 A1 WO2004097339 A1 WO 2004097339A1 AU 2004000452 W AU2004000452 W AU 2004000452W WO 2004097339 A1 WO2004097339 A1 WO 2004097339A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
parcels
points
parcel
database
Prior art date
Application number
PCT/AU2004/000452
Other languages
English (en)
Inventor
Michael James Fletcher
Michael Hele Elfick
Original Assignee
Geodata Information Systems Pty Limited
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from AU2003902049A external-priority patent/AU2003902049A0/en
Application filed by Geodata Information Systems Pty Limited filed Critical Geodata Information Systems Pty Limited
Priority to AU2004234414A priority Critical patent/AU2004234414B2/en
Publication of WO2004097339A1 publication Critical patent/WO2004097339A1/fr

Links

Classifications

    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
    • G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
    • G09B29/003—Maps
    • G09B29/006—Representation of non-cartographic information on maps, e.g. population distribution, wind direction, radiation levels, air and sea routes
    • G09B29/007—Representation of non-cartographic information on maps, e.g. population distribution, wind direction, radiation levels, air and sea routes using computer methods
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C15/00—Surveying instruments or accessories not provided for in groups G01C1/00 - G01C13/00
    • G—PHYSICS
    • G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09B—EDUCATIONAL OR DEMONSTRATION APPLIANCES; APPLIANCES FOR TEACHING, OR COMMUNICATING WITH, THE BLIND, DEAF OR MUTE; MODELS; PLANETARIA; GLOBES; MAPS; DIAGRAMS
    • G09B29/00—Maps; Plans; Charts; Diagrams, e.g. route diagram
    • G09B29/10—Map spot or coordinate position indicators; Map reading aids
    • G09B29/106—Map spot or coordinate position indicators; Map reading aids using electronic means

Definitions

  • the present invention relates to a method and apparatus for determining a transformation for transforming a feature set defined with respect to a first network to a second network.
  • the invention relates to determining a transformation for mapping a cadastral data set to a new reference cadastre.
  • the present invention also relates to a database for storing cadastral data, and in particular, a method and apparatus for storing, retrieving and amending data within the database.
  • GIS geographic information systems
  • LIS land information systems
  • cadastral systems are based on data that has been collected for over 100 years and its quality and accuracy of each record is generally a function of the date of the record itself and the surveying technology available at the time.
  • survey transits were not commonly in use and angles were measured to the nearest half-degree.
  • developments in angle measurement technology in survey transits and theodolites have improved this accuracy and many of the modern instruments in use have an accuracy of close to five seconds of arc.
  • the technology for manually measuring distances steadily improved until about 1970 when electronic distance measurement was introduced. Modern instruments can now measure distances of 1000 meters to a precision of better than five millimetres.
  • a coordinate can provide a unique and unambiguous definition of a point and global positioning system (GPS) can provide the necessary technology to quickly and accurately locate that point.
  • GPS global positioning system
  • At present most surveyors compute new subdivisions laying in the corners by coordinates, then preparing "metes and bounds" documents to satisfy the legal requirements for land transfer.
  • Technology has allowed surveyors to adopt a coordinate based approach and this can be used to reform the land ownership record system.
  • a typical cadastral data set will include a base layer defining packets or parcels, the boundaries of which are defined in accordance with land ownership. Subsequent layers will then provide data regarding respective features related to the land such as permissible land use, natural features, buildings, telephone poles, roads, rail networks, or the like. In this instance, this allows individuals to select a respective layer from a cadastral data set and thereby observe the positioning of respective features with respect to land boundaries. The relationship between these layers is known as the "associativity".
  • Some existing GIS applications software packages provide ways to create points and lines in relative position to other features. However, in most cases, the relativity data is discarded and only the absolute coordinates of the points are stored for each layer. Accordingly, if the base layer is changed at a later date, then the associated points on other related or associated layers are no longer in their correct relative position to the base layer.
  • telegraph poles may be located by their offset from street boundaries, and at a later date the street boundaries are changed because a better value for their geographic position is available. If corrections are not applied to the telegraph pole layer, they will appear to be incorrectly located with respect to the street boundaries. As there may be many layers dependent on the base cadastral layer, any changes to that layer have to be allowed for in all the associated layers and in the past changing all of the associated layers has been an expensive manual and time consuming process.
  • the measurement based approach carries significant overhead in the building and maintenance of the "connection layer". This is labour intensive and, therefore results in a very expensive process, with significant set-up costs.
  • the least squares adjustment approach uses the associated network itself as the "control layer” and therefore does not require extra information to be built and maintained. It works best with structures like power line grids etc., where the changes in the base cadastre are relatively uniform and there are no sudden "jumps" between the old and new cadastre. However, it does require considerable computing resources during the processing and some special expertise in the setting up and formulation of the adjustment process.
  • the rubber sheeting systems can provide a general solution to most data types provided that there is adequate control, but they tend to distort the visual appearance of networks such as power lines etc. Additionally this technique will tend to improve positional accuracy near to each control point but overall they do nothing to correct the inaccuracies in the base data, which is exacerbated due to the fact that only a few control points may be easily defined.
  • cadastral databases can be very large and are subject to continual change as well as having a high level of enquiries.
  • NSW has about four million parcels made up of about 25 million lines. Each day between 40 and 50 new plans are lodged to create 150 to 200 new titles. There are also over 1000 search requests for data from the register.
  • the present invention provides a method for determining a transformation for transforming a feature set defined with respect to a first network to a second network, the method including: a) Comparing the first network to the second network; b) Defining a number of pairs of common points, each pair of common points including corresponding points in the first and second networks; and, c) Determining a transformation for transforming the first network to the second network in accordance with the determined common points.
  • the first and second networks are formed from respective parcel networks, the method including: a) Selecting a feature in the first network; b) Determining a corresponding feature in the second network; and, c) Defining the common points in accordance with the determined corresponding features.
  • Each feature can have a unique identifier, in which case the method can include: a) Comparing the identifiers of features in the first and second networks; and, b) Determining the corresponding features in accordance with the results of the comparison.
  • the method may include: a) Comparing the shape of features in the first and second networks; and, b) Determining the corresponding features in accordance with the results of the comparison.
  • the method of defining the common points may include: a) Selecting a point in the first network; and, b) Selecting a corresponding point in the second network.
  • the feature is typically a parcel, such as a land boundary parcel.
  • any features common to the reference and feature network such as buildings, telegraph poles, or other features can be used.
  • the identifier can be a parcel centroid, or other identifier.
  • the points can be located on a parcel boundary, and are typically the parcel boundary vertices.
  • the first and second networks may include a number of points, the method including determining common points for a predetermined number of the points.
  • the method can include: a) Considering the points in the first and second networks; b) Rejecting selected ones of the points in accordance with predetermined criteria; and, c) Determining common points for a predetermined number of the remaining points.
  • the criteria may include that the points form part of a curved parcel boundary.
  • the predetermined number of points can include at least 10% of the number of points, at least 50% of the number of points, or substantially all of the points.
  • the method may further include: a) Determining a displacement for each pair of common points, the displacement representing the difference in position of the common points within the pair; b) Modifying at least one of the pairs of common points in accordance with the determined displacement; and, c) Determining the transformation in accordance with the modified common points.
  • the method typically includes: a) Generating a contour map in accordance with the displacements in a first direction; b) Determining at least one incorrectly defined pair of common points in accordance with the contour map; and, c) Correcting any incorrectly defined pairs of common points by selecting a new point in the first or second networks.
  • the method may also include: a) Generating a contour map in accordance with the displacements in a second direction, the second direction being orthogonal to the first; b) Determining at least one incorrectly defined pair of common points in accordance with the contour map; and, c) Correcting any incorrectly defined pairs of common points by selecting a new point in the first or second networks.
  • the method can include determining an incorrectly defined pair of common points by locating a predetermined structure in the contour map.
  • the predetermined effect may be a whirlpool effect surrounding the incorrect common points.
  • the transformation is typically in the form of a transformation grid.
  • the method may include determining the transformation in accordance with the displacements, which can be displacement vectors.
  • the method may include-. a) Generating a modified first network by applying the transformation to the first network; b) Comparing the modified first network to the second network; and, c) Determining the success of the transformation in accordance with the results of the comparison.
  • the method can further include determining a new transformation if the transformation is deemed to be unsuccessful.
  • the method can be performed using a processing system having a store and a processor, in which case the method typically includes causing the processor to: a) Obtain feature data representing the feature set; b) Compare the first network to the second network; c) Define a number of pairs of common points, each pair of common points including corresponding points in the first and second networks; d) Determine a transformation for transforming the first network to the second network in accordance with the determined common points; and, e) Apply the determined transformation to each network in the feature set, to thereby transform the feature set to the second network.
  • the processing system can include a display and an input for receiving input commands for a user, the method including causing the processor to: a) Generate a contour map; b) Display the contour map to the user on the display; and, c) In accordance with input commands from the user: i) Determine at least one incorrectly defined pair of common points ; and, ii) Correct any incorrectly defined pairs of common points by selecting a new point in the first or second networks.
  • the feature set may be a cadastral data set or some other fundamental data set for GIS.
  • the first network usually represents an existing cadastral base layer, or other layer, in the GIS, with the second network being a reference layer of new, changed or improved cadastre.
  • the parcel may be a land boundary parcel, or may be any other feature in the respective network.
  • the present invention provides a method of transforming a feature data set defined with respect to a first network to a reference data set defined with respect to a second network, the method including: a) Determining a transformation in accordance with the method of the first broad form of the invention; and, b) Applying the transformation to each of the networks in the feature set.
  • the present invention provides a computer program product for determining a transformation for transforming a feature set defined with respect to a first network to a reference data set defined with respect to a second network, the computer program product including computer executable code which when executed in a suitable processing system causes the processing system to perform the method of first broad form of the present invention.
  • the present invention provides apparatus for determining a transformation for transforming a feature set defined with respect to a first network to a reference data set defined with respect to a second network, the apparatus including a processing system adapted to: a) Compare the first network to the second network; b) Define a number of pairs of common points, each pair of common points including corresponding points in the first and second networks; c) Determine a transformation for transforming the first network to the second network in accordance with the determined common points; and, d) Apply the determined transformation to each network in the feature set, to thereby transform the feature set to the second network.
  • the processing system includes: a) A store for storing: i) Feature data representing the feature set; and, ii) Reference data representing the second network, iii) Transition data representing the transformation data between the feature network and the reference network, and b) A processor adapted to: i) Perform the method of the first broad form of the invention; and, ii) Store transition data representing the transformation in the store. .
  • the present invention provides a method of storing cadastral data in a database defining a parcel network, the method including: a) Receiving cadastral data defining a packet having a number of parcels; b) Comparing the packet to predetermined criteria; c) Modifying the parcels in accordance with the results of the comparison; and d) Adding the data representing the modified parcels to the database.
  • the predetermined criteria typically include the coordinate system of the parcel network, the method including: a) Comparing the coordinate system of the received packet to the coordinate system of the parcel network; and, b) Transforming the coordinate system of the packet in response to an unsuccessful comparison.
  • the predetermined criteria may also include at least one of: a) The closure accuracy of each parcel; b) The stated area of each parcel compared to the computed area of the parcel; c) The precision with which each corner fits with the corresponding corner in the parcel network; and, d) A "least squares adjustment" to determine the effect of adding the new parcels on the parcel network.
  • the method typically includes: a) Receiving cadastral data defining a packet having a number of parcels; b) Generating a representation of the parcels; c) Joining the parcels to form a new parcel network; and, d) Adding the new parcel network to the parcel network.
  • the method is preferably performed using a processing system coupled to the database.
  • the method can include modifying the parcels in accordance with the first broad form of the invention.
  • the present invention provides apparatus for storing cadastral data in a database defining a parcel network, the apparatus including a processing system coupled to the database, the processing system including a processor adapted to: a) Receive the cadastral data defining a packet having a number of parcels; b) Compare the packet to predetermined criteria; c) Modify the parcels in accordance with the results of the comparison; and d) Add the data representing the modified parcels to the database.
  • the processing system is typically adapted to perform the method of the fifth broad form of the invention.
  • the processor is typically adapted to modify the cadastral data in accordance with input commands received from the user.
  • the present invention provides a method of updating cadastral data in a database defining a parcel network, the method including: a) Retrieving cadastral data defining a packet having a number of parcels; b) Altering the parcels within the packet; c) Comparing the modified packet to predetermined criteria; d) Further modifying the parcels in accordance with the results of the comparison; and e) Updating the database in accordance with the modified parcels.
  • the predetermined criteria typically including provision of details of the alterations, including information for identifying: a) The parcels altered; b) The date and nature of the alterations; c) The purpose of the alteration; d) The individual making the alteration; and,
  • the predetermined criteria typically include at least one of: a) The closure accuracy of each parcel; b) The stated area of each parcel compared to the computed area of the parcel; c) The precision with which each corner fits with the corresponding comer in the parcel network; d) A "least squares adjustment" to determine the effect of adding the new parcels on the parcel network. e) The presence of database id numbers which match those in the database; and, f) That edge points of the packet are not allowed to change in co-ordinate position.
  • the method may also include: a) Selecting a number of parcels defining a packet; b) Creating a copy of the cadastral data defining the packet to thereby retrieve the cadastral data; and, c) Locking the cadastral data in the database corresponding to the retrieved packet, to thereby prevent further modification of the packet.
  • the method may also further include updating the database in accordance with the modified parcels by: a) Creating a copy of the cadastral data representing the unaltered parcels; and, b) Adding the cadastral data representing the altered parcels to the database.
  • the method is typically performed using a processing system coupled to the database.
  • the present invention provides apparatus for updating cadastral data in a database defining a parcel network, the apparatus including a processing system coupled to the database, the processing system including a processor adapted to: a) Retrieve cadastral data defining a packet having a number of parcels; b) Alter the parcels within the packet; c) Compare the modified packet to predetermined criteria; d) Further modify the parcels in accordance with the results of the comparison; and e) Update the database in accordance with the modified parcels.
  • the processing system is typically adapted to perform the method of the seventh broad form of the invention.
  • the processor being is typical adapted to modify the cadastral data in accordance with input commands received from the user.
  • Figure 1 is a flow chart of the process of the present invention
  • Figure 2 is a schematic diagram of an example of a system for implementing the present invention
  • Figure 3 A and 3B are a flow chart of the process implemented by the system of Figure 1;
  • Figure 4 is schematic diagram of an example of a reference network and a target network as presented to a user of the processing system of Figure 2;
  • Figure 5 is schematic diagram of a close up of a portion of Figure 4;
  • Figure 6 is schematic diagram of an example of a contour map as presented to a user of the processing system of Figure 2;
  • Figure 7 is schematic diagram of a close up of a portion of Figure 6;
  • Figure 8 is schematic diagram of an example of the reassignment of one of the common points
  • Figure 9 is schematic diagram of the contour map of Figure 7 as revised following the reassignment of the common point
  • Figure 10 is schematic diagram of the contour map of Figure 6 as revised following the reassignment of the common point;
  • Figure 11 is schematic diagram of the corrected target network;
  • Figure 12 is schematic diagram showing a corrected target network of Figure 11 compared to the reference network
  • Figure 13 is a schematic diagram of a second example of a system for implementing the present invention
  • Figure 14 is a schematic diagram of an example of one of the end stations of Figure 13;
  • Figure 15 is a flow chart outlining the process of storing new parcels in a cadastral database
  • Figure 16 is a flow chart of one example of a method of storing new parcels in a cadastral database.
  • Figure 17 is a flow chart of one example of a method of altering parcels in a cadastral database.
  • step 100 the existing cadastral data set to be updated is obtained, with the new reference network, which typically forms a reference cadastre, being obtained at step 110.
  • the feature data may be received in any one of a number of forms and this will typically depend on the data source.
  • the cadastral data set may be a data set belonging to an entity which has previously performed their own surveys on local datum and which now wishes to map their existing surveys to a reference network, such as a "world based" coordinate system. This may be performed for example to transfer an existing cadastre to a GPS generated reference network as will be appreciated by a person skilled in the art.
  • a geodetic datum is a defined spheroid used as the computing surface for geodetic calculations. Typically it is an ellipse in rotation fitted to a number of points around the country set at a particular height.
  • the AGD is a spheroid fitted to a number of tide gauges which defined mean sea level around Australia in 1966. Its semi major axis is 6378160 metres and flattening is 1/298.25.
  • the GDA is very close to a world based datum (WGS84). Accordingly, as GPS technology develops, it is desirable to be able to change coordinate systems from a local datum such as AGD to a world based datum GDA.
  • this may again be received from an external source, or be predetermined.
  • the reference network is formed from a parcel network having parcels relating to land ownership, or the like.
  • the determination of common points will be achieved by matching parcels within a layer of the cadastral data set having an equivalent network (hereinafter referred to as the "target" network) with corresponding parcels in the new reference network, as will be described in more detail below.
  • a transformation is generated.
  • the transformation which is typically in the form of a correction grid, will map points in the target network to corresponding points in the new reference network.
  • this allows the transformation to be applied to the target network at step 140, thereby mapping the target network onto the reference network. This can be used to make sure that the transformation is acceptable.
  • the transformation can also be applied to all remaining layers in the feature data set at step 150, thereby allowing the entire feature data set to be mapped to the new reference network. As these final stages may be performed separately, or by a different entity, these steps are shown in dotted lines.
  • the apparatus is formed from a processing system 10 having a processor 20, a memory 21, an input/output (I/O) device 22 and an optional external interface 23 coupled together via a bus 24 as shown.
  • a processing system 10 having a processor 20, a memory 21, an input/output (I/O) device 22 and an optional external interface 23 coupled together via a bus 24 as shown.
  • the feature data set may be provided to the processing system either via the input device 22 or the external interface 23, and the manner in which this is achieved will depend on the nature of the feature data set.
  • the cadastral data set will typically have a high data volume, and may therefore be supplied directly via the external interface from another processing system, or the like.
  • the processing system 10 is adapted to execute appropriate applications software stored in the memory 21, to allow the transformation to be determined.
  • the processing system is also adapted to apply the transformation to the feature data set to thereby allow the layers therein to be defined with reference to the new reference network.
  • the processing system may be any form of processing system suitably programmed to perform the analysis.
  • the processing system may therefore be a suitably programmed computer, lap-top, palm computer, or the like.
  • specialised hardware or the like may be used.
  • the processing system 10 obtains the existing feature data set to be updated at step 200, with the new reference network being obtained at step 210.
  • the feature data set may be received from an external source via the external interface 23.
  • the reference network may be obtained in a similar manner, or may be pre-stored in the memory 21.
  • the processing system will operate to store data in the memory 21 representing both the reference network and the feature data set.
  • the processing system selects a target network from the layers in the existing feature data set.
  • this target network will need to correspond to the new reference network, and in particular will need to include corresponding information thereon.
  • the new reference network includes an indication of the location of telegraph poles, it will be necessary to select the target network to be a layer which also includes information regarding the location of telephone poles.
  • the target network and the reference network are typically defined as a number of polygons, with polygons in the target network being mapped to the polygons in the base cadastre. This is therefore typically achieved by generating a parcel network as will be appreciated by a person skilled in the art.
  • the reference network includes information relating to land boundaries then it will be necessary to select a target network including land boundaries from the existing feature data set to ensure that similar polygons are present in the target network and the reference network. Otherwise, if a different layer from the existing feature data set were used, such as a layer relating to road positions, the layer would include different polygon structures in the target network to those in the reference network, thereby preventing a successful transformation being performed.
  • the parcels may be based on any form of information however, it is essential that the parcels are based on the same information.
  • the remainder of the example will focus on the use of parcel networks representing land boundaries.
  • the processing system 10 will store details of points in the target and reference networks in the form of point data in the memory 21. These points generally form nodes within the network, such as boundary vertices, or the like, as will be appreciated by persons skilled in the art.
  • the processing system 10 matches parcels in the target network and in the new reference network. This is carried out on a polygon by polygon basis such that each polygon in the current system is mapped to a corresponding polygon in the target system by performing an appropriate search. This may be performed in a number of ways.
  • each polygon in the reference network and the target network may be provided with a unique identifier that will allow the polygons to be mapped to each other directly. This may be achieved for example in accordance with land ownership, plot number, or any other suitable identifiers which allow corresponding polygons to be identified.
  • the processing system 10 determines or confirms the matches by examining the shape, area and position of the polygons. In particular, this is usually achieved by having the processing system 10 examine polygons at a similar locations in the target and reference networks, and then comparing the area and centroid position of these polygons until a likely match is found.
  • GUI graphical user interface
  • some polygon pairs may have a different size and shape due to differences in the survey process or parcel definition.
  • a typical example of this is when the parcels include a curved boundary, as shown in Figure 5, which is a close up view of the region 40 in Figure 4.
  • curved boundaries have up until recently been considered as a number of short line segments.
  • the curved boundary on the target network will typically consist of a number of straight lines 41, whereas the corresponding boundary in the reference network will include a curved line 42. Whilst it is still possible for the processing system 10 to match the polygons in the reference network to the polygons in the target network, this will have implications in the subsequent processing steps.
  • the processing system 10 is adapted to perform a search of the network for any line patterns of this form and then eliminate these from the subsequent processing steps. This will typically be achieved by removing the corresponding points from the point data stored in the memory 21.
  • the processing system 10 operates to select pairs of common points in the reference network and the network layer at step 250.
  • An example of this is shown in Figure 5 by the points Tl, T2, T3, T4 on the target network T and the corresponding points Rl, R2, R3, R4 on the reference network R.
  • the processing system 10 determines displacement factors between the common points in each pair.
  • the processing system 10 will determine displacements in orthogonal directions typically along X and Y axes, and then stores the displacements as a displacement vector in the memory 21.
  • the displacement vectors can be stored as attributes of the points in the reference or target network, and can therefore be associated with the point data, as will be appreciated by a person skilled in the art.
  • step 270 the processing system 10 generates a contour map representing displacements between corresponding points.
  • An example of a contour map is shown in Figure 6, with a close up of the region 43 being shown in Figure 7, with the contours shown at 45.
  • a respective contour map may be generated for displacements in the X direction and for displacements in the Y direction so that one or two respective contour maps may be shown.
  • the contours should be reasonably uniform in distribution across the contour map. Where significant differences exist between the locations of the corresponding points in a respective pair of common points, this will be represented by a steep gradient and hence a large number of contours on the contour map.
  • pairs of common points that have been incorrectly defined will be highlighted by whirlpool areas of close contours on the contour map.
  • An example of this is shown at area 43 in Figure 6.
  • a close up of this is shown in Figure 7.
  • the point A on the reference network has been mapped to the point B on the target network.
  • point A should have been mapped to the point C and accordingly, a contour whirlpool exists around the point B indicating that point B is incorrectly assigned.
  • the user modifies corresponding points in accordance with the contour map.
  • the user alters the pair of common points so that the common points are now points A and C as required. This is typically achieved by having the user select the incorrect common point on the contour map presented on the GUI using an input device such as a mouse, and then select a new common point in the same way. Alternatively the user may simply enter new coordinates at which the common point should occur.
  • step 290 the processing system 10 will operate to recalculate the displacement vector, which will replace the existing common point displacement vector stored in the memory 21 for the respective common points.
  • the processing system can then regenerate the contour map for checking.
  • FIG. 10 An example of the regenerated contour map is shown in Figure 10, with a close up of the corrected common points in the region 44 shown in Figure 9. As shown the contours in the corrected region include far smoother contour lines without the whirlpool effect indicating that the common point selection for this respective pair of common points is now successful.
  • the processing system 10 determines a correction grid in accordance with the selected displacement factors.
  • the correction grid is formed using a triangular network having vertices located at the common points, with the deformation of the triangular network under the determined displacements setting the transformation that will be required for points falling within the triangular area.
  • This correction grid can then be applied to the target network, as shown for example in Figure 11.
  • the success of the correction grid can be checked by applying the correction grid to the target network and then superimposing the corrected target network on the reference network as shown in Figure 12.
  • the original target network is indicated by the boundaries T, with the modified target network represented by the boundaries M.
  • the modified target network M is substantially identical to the reference network.
  • the correction grid can be stored in the memory 21 and then subsequently applied to remaining layers in the GIS related to the existing feature data set to map these to the new base cadastre as will be appreciated by a person skilled in the art.
  • the correction grid may be output to an external processing system, for example via the external interface 23, to allow the correction of the cadastral data set to be performed remotely.
  • the process operates to provide a means to warp an existing network of polygons to fit with a new network of the same polygons which have been spatially displaced in various amounts according to their position in the network.
  • the new network is referred to as the reference network, with the old network being referred to as the target network.
  • the processing system 10 receives a data set representing the target network and stores this in the memory 21. This may be achieved in a number of ways, but is typically achieved by storing a target point having a target coordinate value for each node or point in the network. Similarly, reference coordinate values are stored for the nodes or points in the reference network.
  • the processing system 10 under guidance of the operator follows the following stages:
  • the processing system 10 searches the polygons in the target layer to find a corresponding polygon in the reference cadastre. If there is a unique identifier for each polygon, then this can be used to select likely polygon pairs. If not, likely pairs can be found by looking for those which have a similar area and whose centroid positions are close to each other.
  • Polygon pairs may have a different number of sides and be slightly different in shape, however there will be some line segments which will correspond very closely and the points on the ends of these line segments can be considered as "common points".
  • the curved boundaries and irregular boundaries will often be represented as a series of short segments of similar length. A search is made for this type of line pattern and these lines are excluded from the process.
  • the processing system 10 selects the longest line in the reference network polygon, then computes the vector from its polygon centroid to the mid point of the selected line. On the target polygon in the target layer, the processing system 10 finds a line of similar length with a similar vector from its centroid.
  • the processing system 10 checks the direction of the lines as they are in their polygon to determine whether each polygon line sequence is in either a clockwise or anti clockwise direction, and then computes the transformation parameters to rotate, scale and shift the end points on the target line to match the end points of the reference line.
  • the processing system 10 finds a corresponding point in the target polygon to form a pair of common points.
  • the processing system 10 takes the coordinate for each point in the target polygon (excluding points on arcs and irregular lines) is transformed using the transformation parameters computed form the initial reference line, and a number of closest points are selected as the potential corresponding points.
  • the processing system 10 then tests the points more rigorously by performing the following steps:
  • the target point and reference point form a pair of common points.
  • the processing system 10 then computes target coordinate value and the reference coordinate value. These values are stored as attributes of the reference point in the memory 21.
  • the processing system 10 generates a triangular network (TIN) for the common points and this is used to generate a contour map for either the displacements in X or displacements in Y between the common points.
  • TIN triangular network
  • the displacement vector at each common point may also displayed to the user at this time.
  • the TIN can then be edited by adding or excluding points matched points. A point is excluded by selecting it with a mouse and a point is included by selecting the point pair with a mouse. After each editing sequence the TIN and contours are recomputed and the results displayed.
  • Editing ceases when the operator considers that the matched points correctly show the warping needed to bring the target network to correspond with the reference network.
  • the processing system then generates a "correction grid" from the TIN.
  • the correction grid is formed as a table of corrections with the intersection of each row and column corresponding to a location on the surface of the earth.
  • the value for each point on the correction grid is interpolated from the three values at the apex points of the surrounding triangle in the TIN.
  • correction grid can be applied to any layer in a processing system which is associated with the target network, as will be appreciated by persons skilled in the art.
  • the position of telegraph poles in the reference network and the feature data set can be compared in a manner similar to that defined above with respect to the parcels.
  • the location of each telegraph pole will be a point, with the common points being selected to be identical telegraph poles. These will be determined in a manner similar to that described above.
  • any suitable feature may be used, such as buildings, or the like.
  • the position of telegraph poles in the reference network and the feature data set can be compared in a manner similar to that defined above with respect to the parcels.
  • the location of each telegraph pole will be a point, with the common points being selected to be identical telegraph poles. These will be determined in a manner similar to that described above.
  • any suitable feature may be used, such as buildings, or the like.
  • a respective processing system 10 may be provided for each individual that is to use the system. This could be achieved by supplying respective applications software for an individual's computer system, or the like, for example on a transportable media, or via download. In this case, if modifications to the processing techniques are determined, these could be made available through program updates or the like, which again may be made available in a number of manners.
  • alternative architectures such as distributed architectures, or the like, may also be implemented.
  • FIG. 13 An example of this is shown in Figure 13 in which the processing system 10 is coupled to a database 11 , provided at a base station 1.
  • the base station 1 is coupled to a number of end stations 3 via a communications network 2, such as the Internet, and/or via communications networks 4, such as local area networks (LANs) 4.
  • LANs local area networks
  • the LANs 4 may form an internal network at a company, medical institution, or the like, depending on the nature of the system and the types of sequences being distinguished.
  • end stations 3 In use the end stations 3 must be adapted to communicate with the processing system 10 positioned at the base station 1. It will be appreciated that this allows a number of different forms of end station 3 may be used.
  • the end station 3 includes a processor 30, a memory 31 and an input/output (I/O) device 32 such as a keyboard and monitor and an external interface 33, coupled together via a bus 34, as shown.
  • I/O input/output
  • the internal interface 35 is provided to allow the end station to be coupled to one of the communications networks 2, 4.
  • the processor 30 is adapted to communicate with the processing system 10 provided in the base station 1 via the communications networks 2, 4 to allow the above described process to be implemented. Accordingly, it will be appreciated that if the communications network 2 is the Internet, this will typically be achieved by having the base station 1 present web pages to users of the end stations 3.
  • the end stations 3 may be formed from any suitable processing system, such as a suitably programmed PC, Internet terminal, lap-top, hand- held PC, or the like, which is typically operating applications software to enable data transfer and in some cases web-browsing.
  • a suitably programmed PC such as a PC, Internet terminal, lap-top, hand- held PC, or the like, which is typically operating applications software to enable data transfer and in some cases web-browsing.
  • the feature data set to be updated may be supplied to the processing system 10 via the end station 3, allowing the processing system 10 to determine the transformation or correction grid as described above.
  • the correction grid can then be applied to the feature data set, or be transferred to the end station 3 for subsequent use.
  • access to the process may be controlled using a subscription system or the like, which requires the payment of a fee to access a web site hosting the process. This may be achieved using a password system or the like, as will be appreciated by persons skilled in the art.
  • Cadastral Database An example of the manner in which parcel data may be stored in a database and subsequently modified will now be described with reference to Figures 15 to 17.
  • Figure 15 describes an overview of the process of maintaining a database with a parcel data.
  • the process is achieved using a processing system similar to the processing system 10 shown in Figure 2, which is coupled to a cadastral database containing cadastral data via the external interface 23.
  • a processing system similar to the processing system 10 shown in Figure 2 which is coupled to a cadastral database containing cadastral data via the external interface 23.
  • the techniques outlined below could be achieved using any suitable architecture.
  • a packet representing the parcels to be added to the database are defined. This is typically achieved by either importing the data to the processing system 10 from external data source, such as a separate database, from survey data or the like, or by entering the data manually.
  • the parcels are compared to predetermined criteria to determine if they are acceptable for inclusion within the database at step 410. As set out in more detail below, this will typically involve at least checking the coordinate system of the defined parcels to ensure that they can be correctly integrated into database.
  • the coordinate system of the database is typically the world coordinate system based on the coordinates of latitude and longitude. Accordingly, it will be appreciated that as many surveys are performed on the basis of planar Cartesian coordinate systems, transformation of the coordinates is necessary in order for the parcels to correctly map to the database coordinate system. This can be achieved using the processes outlined above.
  • the modified parcels are added to the database at step 430.
  • the database may include any one of the number of schemas and the respective schema will depend and effect the manner in which this is achieved, as will be described in more detail below.
  • the parcels defined therein can be subsequently modified as required, for example if more accurate survey data is determined, or if changes are made to parcel boundaries.
  • the user can select the parcels to be updated.
  • the parcels are extracted from the database as a respective packet.
  • the user can then modify the selected parcels as required at step 460 before updating the database in accordance with the modified parcels at step 470.
  • the result of this is that the user can operate to work only on the parcels contained in the packet.
  • this ensures that the user is working on only a small volume of data thereby making the modification operation computationally inexpensive and quick.
  • the modified parcels must also satisfied predetermined criteria, as outlined above with respect to new parcels, to ensure that they can be correctly integrated into the existing parcel network defined in the database.
  • a further feature of this technique is that the extracted packet can be created as a copy of the cadastral data in the database, such that the original data remains in the database while the modifications are being made.
  • the parcels contained within the extracted packet are flagged on the database to warn any enquirers that a change is in progress and they are also "locked” to prevent a further change taking place until the current transaction for the packet has been completed. This also allows other users to interact with the parcels within the database without being effected by the changes caused by the modification of the parcels.
  • step 500 the user inputs data defining the parcels contained within a packet to be added to the database. This will typically initially consist of inputting boundary data, vertices, coordinates or the like.
  • the processing system 10 typically displays a representation of the defined parcels to the user. This allows the user to join the parcels together at step 520 to form a parcel network. Thus, if all of the parcels are already interconnected in the received packet, steps 510 and 520 may not be required. Typically however it is necessary to adjust parcels from different surveys so that the parcels correctly fit together to define a network.
  • the geometry of the parcels are checked to determine if they can be integrated into the parcel network defined by the cadastral database at step 530. Thus, for example, this will include ensuring the coordinate system of the parcel network and the coordinate system of the cadastral data in the database are the same.
  • the packet is considered to determine if the geometry can be modified at step 550. If not, then it will be appreciated that the parcels defined by the packet cannot be written into the database. However, typically the geometry can be modified and this is therefore performed at step 570, before the check of the geometry is repeated at step 530.
  • the parcels of the packet are checked to determine if they will fit within the parcel network defined by the cadastral database at step 580. Thus, for example, this will ensure that the parcels can be joined to existing parcels in the database, and that there is no overlap with existing parcels, or the like.
  • the packet is considered to determine if the parcels can be modified at step 600, for example, by the addition of linking parcels, or the like. If not, then it will be appreciated that the parcels defined by the packet cannot be written into the database as set out at step 560. Otherwise, the parcels are modified at step 610, before the fit is rechecked at step 580.
  • the effect of adding the parcels in the packet to the parcel network defined by the database is checked at step 620.
  • this will ensure that addition of the parcels will not result in undue deformation of existing parcels, if modification of the existing parcels is required to allow the existing parcels to correctly join to the parcels in the packet to be added.
  • the packet is considered to determine if the parcels can be modified at step 640, for example, by the alteration of parcel boundaries, or the like. If not, then it will be appreciated that the parcels defined by the packet cannot be written into the database as set out at step 660. Otherwise, the parcels are modified at step 650, before the check is repeated at step 620.
  • the processing system 10 updates the database by writing new cadastral data defining the parcels in the packet into the database in accordance with the database schema, at step 660.
  • the database schema is as set out below in Appendix A, which as will be appreciated by persons skilled in the art, ensures that sufficient information is provided for the parcels to be of use in practical situations.
  • the process outlined above therefore operates to ensure that the parcels included in the packet are suitable for inclusion within the database by checking the parcel geometry, as well as the fit with existing parcels.
  • checks of the data against additional criteria may also be performed in a similar manner. Thus for example, it may be desirable to ensure certain degrees of accuracy for the parcels before they are added into the database.
  • Other checks may include checking:
  • processing system 10 will execute applications software which causes specific criteria to be checked automatically or in accordance with manual intervention, before the parcels can be added to the database.
  • the user selects a region of parcels covered by the database. This may include for example a town, an area within a town such as a suburb, or the like.
  • the processing system 10 typically generates a representation of the selected region. This allows the user to select a number of parcels from the representation at step 720, which may be achieved by having the user highlight the parcels on the representation. It will be appreciated that the selection of parcels may be achieved in a number of manners depending on the database and its implementation and that this is not important for the purposes of this invention.
  • the processing system 10 generates a query based on selected parcels.
  • the query is an SQL query used for extracting cadastral data from the database in the usual way.
  • the processing system 10 extracts a packet containing the selected parcels.
  • the packet contains a copy of the cadastral data for each of the parcels, with the cadastral data of the parcels also being retained within the database.
  • the parcels in the database are locked so that they may not be simultaneously edited by other third parties also using the database. This is achieved by setting a flag in the cadastral data stored in the database which indicates to other users that the data is currently undergoing modification and which prevents the data being extracted for modification by any other individuals. This means that other parties can continue to use the database and in particular view the parcels that are currently undergoing modification, thereby allowing the database to be updated whilst in use.
  • a user accesses a parcel that is currently being modified, they will generally be provided with an indication, such as by having the parcel displayed in a different colour or the like.
  • step 750 the user modifies the parcels and the packet at required.
  • the manner in which this is performed will depend on the modifications occurring but will typically revolve modifying one or more parcels, adding parcels, removing parcels, moving parcel boundaries or vertices, or the like. This may be achieved utilising appropriate parcel editing software as will be appreciated by a person skilled in the art.
  • the user only works on parcels contained within the packet extracted from the database, and this is achieved by having the processing system act directly on the cadastral data contained within the packet. As this includes only a limited volume of data, there is no delay in having the processing system 10 having to access and modify large quantities of data within the database.
  • the processing system 10 compares the modified packet to predetermined criteria.
  • the predetermined criteria are used to ensure consistency of parcel modification, and this will typically involve checking:
  • a "least squares adjustment" may be carried out on the updated packet to determine the effect on the existing boundary network from the inclusion of the new data.
  • Additional checks may include checking the coordinate system employed by the modified parcels, as well as checking that information regarding the update is provided. This will include details, such as details of the individual modifying the parcels, the time and date on which the modifications were made, the reasons for the modifications, and the like. This will also typically include the requirement that any modifications to the database are signed off by an examiner and resubmitted back to the database. It will be appreciated that satisfaction of the criteria may be achieved in a manner similar to that described with respect to Figure 16.
  • the processing system determines if the criteria are satisfied, and if not, the user is informed that further changes must be made to the packet at step 750. Otherwise, the processing system 10 adds the modified data packets to the database at step 780.
  • the processing system 10 also creates the record of the changes made and store a copy of the parcels prior to the amendment thereby allowing the original status of the database to be retrieved should this become necessary.
  • the system will retain all historical data including point, parcel and plan definitions as parcels are retired. This data will be flagged as 'Historical' and will not show as the 'Current' cadastral network definition. This historical plan/parcel data will be able to be seen using the viewer when enabled, allowing updates to the parcel network to be reviewed at a later date. This allows the status of a parcel network at any date to be reviewed.
  • cadastral data will be deleted from the database, it will always be archived.
  • the old copy is not erased, it is stored in the archive data tables.
  • the database will contain a duplicate set of the primary data tables to hold archive data. These data tables may be used in the event of errors in the data to trace when the data values were changed and by whom. It may also be used, by professional IT staff, to reconstruct a 'snapshot' of the Cadastral database at an instant in time.
  • the above described process allows areas of interest within a database to be extracted from the database as a "packet" of cadastral information.
  • the parcels within the packet are flagged on the database to warn any enquirers that a change is in progress and they are also "locked” to prevent a further change taking place until the current transaction for the packet has been completed.
  • the packet can then be processed, signed off by an examiner and resubmitted back to the database. If it is accepted, the area of interest is updated and the area "unlocked".
  • system can be implemented using a suitable processing system 10, or end station 3 coupled to the database via a suitable network 2, with the database being implemented as an SQL database. It will be appreciated however that other enquiry and reporting systems can be used.
  • Centroid Type - a numeric parcel type

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Educational Technology (AREA)
  • Educational Administration (AREA)
  • Business, Economics & Management (AREA)
  • Mathematical Physics (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Ecology (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Processing Or Creating Images (AREA)

Abstract

L'invention concerne un procédé de détermination d'une transformation pour transformer un ensemble de caractéristiques défini par rapport à un premier réseau comparé un second réseau. Ledit procédé consiste généralement à comparer le premier réseau au second réseau et à utiliser la comparaison pour définir plusieurs paires de points communs formés à partir de points correspondants dans les premier et second réseaux. Ledit procédé consiste à déterminer une transformation pour le premier réseau en un second réseau en fonction des points communs déterminés.
PCT/AU2004/000452 2003-04-30 2004-04-07 Transformation d'ensemble de caracteristiques WO2004097339A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2004234414A AU2004234414B2 (en) 2003-04-30 2004-04-07 Feature set transformation

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US46727003P 2003-04-30 2003-04-30
AU2003902049A AU2003902049A0 (en) 2003-04-30 2003-04-30 Feature set transformation
US60/467,270 2003-04-30
AU2003902049 2003-04-30

Publications (1)

Publication Number Publication Date
WO2004097339A1 true WO2004097339A1 (fr) 2004-11-11

Family

ID=33419173

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/AU2004/000452 WO2004097339A1 (fr) 2003-04-30 2004-04-07 Transformation d'ensemble de caracteristiques

Country Status (1)

Country Link
WO (1) WO2004097339A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1897013A2 (fr) * 2005-06-27 2008-03-12 Marwan Zeibak Dispositif et procede permettant l'evaluation de points de donnees par rapport a des reglements cadastraux
EP1997310A1 (fr) * 2006-01-19 2008-12-03 LG Electronics Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06333019A (ja) * 1993-05-25 1994-12-02 Tokyo Electric Power Co Inc:The 地図合成方法及び装置
JPH11283004A (ja) * 1998-03-27 1999-10-15 Nippon Steel Corp 地籍図データ管理方法
JP2002150308A (ja) * 2000-04-12 2002-05-24 Jekku:Kk 図面編纂システム及び記録媒体
WO2002086770A1 (fr) * 2001-04-24 2002-10-31 Geodata Information Systems Pty Limited Reseaux de parcelles

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06333019A (ja) * 1993-05-25 1994-12-02 Tokyo Electric Power Co Inc:The 地図合成方法及び装置
JPH11283004A (ja) * 1998-03-27 1999-10-15 Nippon Steel Corp 地籍図データ管理方法
JP2002150308A (ja) * 2000-04-12 2002-05-24 Jekku:Kk 図面編纂システム及び記録媒体
WO2002086770A1 (fr) * 2001-04-24 2002-10-31 Geodata Information Systems Pty Limited Reseaux de parcelles

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"GeoCadastre", 28 March 2003 (2003-03-28), Retrieved from the Internet <URL:http://www.geodata.com.au/pdf/pdf/GeoCadastre28-03-03.pdf> *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1897013A2 (fr) * 2005-06-27 2008-03-12 Marwan Zeibak Dispositif et procede permettant l'evaluation de points de donnees par rapport a des reglements cadastraux
EP1897013A4 (fr) * 2005-06-27 2012-11-07 Geo Pioneers Ltd Dispositif et procede permettant l'evaluation de points de donnees par rapport a des reglements cadastraux
EP1997310A1 (fr) * 2006-01-19 2008-12-03 LG Electronics Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre
EP1997311A1 (fr) * 2006-01-19 2008-12-03 Lg Electronics Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre
EP1999954A1 (fr) * 2006-01-19 2008-12-10 LG Electronics Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre
EP1997311B1 (fr) * 2006-01-19 2013-04-10 LG Electronics, Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre
EP1999954B1 (fr) * 2006-01-19 2013-04-10 LG Electronics Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre
EP1997310B1 (fr) * 2006-01-19 2013-04-24 LG Electronics Inc. Procede pour transmettre et recevoir des informations concernant le trafic et appareil permettant sa mise en oeuvre

Similar Documents

Publication Publication Date Title
US7536025B2 (en) Process, system, or method for the determination of the percentage of area of a parcel of land available for development or preservation and the production of a report and map therefor on a fixed tangible medium
Jaselskis et al. Improving transportation projects using laser scanning
WO2007005337A2 (fr) Procede, systeme ou methode permettant de determiner le pourcentage de superficie d&#39;une parcelle de terrain destinee au developpement ou a la preservation et production d&#39;un rapport et d&#39;une carte afferents sur un support tangible fixe
El-Ashmawy Testing the positional accuracy of OpenStreetMap data for mapping applications
Borowski et al. The conversion of heights of the benchmarks of the detailed vertical reference network into the PL-EVRF2007-NH frame
KR20100025144A (ko) 지리 정보 시스템과 건축도면을 기반으로 하는 건축물 전산관리 시스템 및 그 방법
JP2002007440A (ja) 地図データ更新システム、地図データ更新方法および記録媒体
US7574302B2 (en) Parcel networks
KR101023836B1 (ko) 수치지도 생성 시스템
Gösseln et al. Integration of geoscientific data sets and the german digital map using a matching approach
KR101020170B1 (ko) 수치지도 생성을 위한 현장조사 장치 및 그 방법
US8648854B2 (en) Interactive method for designing parcels
Rajabifard et al. Design and implementation of a 3D national digital cadastral database based on land administration domain model: lessons learned from a 3D cadaster project in Malaysia
von Goesseln et al. Semantic and geometric integration of geoscientific data sets with atkis–applied to geo-objects from geology and soil science
AU2004234414B2 (en) Feature set transformation
WO2004097339A1 (fr) Transformation d&#39;ensemble de caracteristiques
Sami et al. Integration of Khartoum Cadastral Information into State and Sudan Base Map
AU2004234414A1 (en) Feature set transformation
Hagemans et al. Rebuilding the cadastral map of The Netherlands, the overall concept
Cina et al. Recovery of cadastral boundaries with GNSS equipment
Bajtala et al. The reliability of parcel area
JP4224263B2 (ja) コンピュータに地図情報を管理させるプログラム
Diakité About the Geo-referencing of BIM models
Hodač et al. Historical Orthophotos Created on Base of Single Photos-Specifics of Processing
Budkowski et al. Issue of quality and reliability of spatial records information in the context of data concerning boundary points

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): BW GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2004234414

Country of ref document: AU

DPEN Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed from 20040101)
ENP Entry into the national phase

Ref document number: 2004234414

Country of ref document: AU

Date of ref document: 20040407

Kind code of ref document: A

WWP Wipo information: published in national office

Ref document number: 2004234414

Country of ref document: AU

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 69(1) EPC - EPO FORM 1205A SENT ON 22-03-2006

122 Ep: pct application non-entry in european phase