This paper proposes a high capacity data hiding algorithm for point-sampled geometry. We introduce the unit length as the quantizer to generate an embedding order list as well as an embedding index list. Our algorithm considers every two elements in the embedding order list as the order pair, and we embed 3 bits of secret message into the index pair associated with the order pair. The message embedding is very efficient requiring, at most, adding 1 to, or subtracting 1 from, the index pair. This reflects a slight perturbation of a point's coordinates where the magnitude of the perturbation is no greater than one unit length. Our algorithm achieves a high embedding capacity, being 4.5 times the number of points in the cover models. The capacity magnitude is 50% higher than that of the current state of art algorithms, but the model distortion is similar to our counterparts. Our scheme is robust against translation, rotation, and uniformly scaling operations, and it is simple to implement. Our algorithm belongs to the blind manner: the message can be extracted without referring to the original cover model. We believe our scheme is appropriate for most point-sampled models.